./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 7c71bc25 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-7c71bc2 [2019-11-25 13:56:26,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:56:26,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:56:26,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:56:26,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:56:26,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:56:26,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:56:26,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:56:26,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:56:26,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:56:26,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:56:26,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:56:26,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:56:26,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:56:26,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:56:26,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:56:26,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:56:26,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:56:26,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:56:26,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:56:26,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:56:26,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:56:26,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:56:26,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:56:26,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:56:26,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:56:26,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:56:26,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:56:26,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:56:26,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:56:26,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:56:26,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:56:26,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:56:26,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:56:26,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:56:26,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:56:26,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:56:26,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:56:26,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:56:26,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:56:26,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:56:26,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 13:56:26,286 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:56:26,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:56:26,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:56:26,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:56:26,288 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:56:26,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:56:26,289 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:56:26,289 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:56:26,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:56:26,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:56:26,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:56:26,291 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:56:26,291 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:56:26,291 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:56:26,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:56:26,292 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:56:26,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:56:26,292 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:56:26,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:56:26,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:56:26,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:56:26,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:56:26,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:56:26,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:56:26,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:56:26,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:56:26,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:56:26,295 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-25 13:56:26,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:56:26,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:56:26,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:56:26,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:56:26,614 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:56:26,615 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-25 13:56:26,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22c7dd1e/35ff00b969ef43c98b633af791ca9284/FLAG3946b5104 [2019-11-25 13:56:27,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:56:27,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-25 13:56:27,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22c7dd1e/35ff00b969ef43c98b633af791ca9284/FLAG3946b5104 [2019-11-25 13:56:27,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22c7dd1e/35ff00b969ef43c98b633af791ca9284 [2019-11-25 13:56:27,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:56:27,539 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:56:27,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:56:27,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:56:27,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:56:27,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:56:27" (1/1) ... [2019-11-25 13:56:27,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f57c6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:27, skipping insertion in model container [2019-11-25 13:56:27,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:56:27" (1/1) ... [2019-11-25 13:56:27,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:56:27,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:56:28,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:56:28,058 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-25 13:56:28,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d5ba37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:28, skipping insertion in model container [2019-11-25 13:56:28,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:56:28,060 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 13:56:28,063 INFO L168 Benchmark]: Toolchain (without parser) took 522.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:56:28,064 INFO L168 Benchmark]: CDTParser took 0.55 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-25 13:56:28,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 519.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:56:28,067 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.55 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 519.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.7 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-7c71bc2 [2019-11-25 13:56:29,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:56:29,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:56:29,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:56:29,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:56:29,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:56:29,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:56:29,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:56:29,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:56:29,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:56:29,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:56:29,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:56:29,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:56:29,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:56:29,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:56:29,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:56:29,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:56:29,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:56:29,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:56:29,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:56:29,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:56:29,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:56:29,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:56:29,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:56:29,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:56:29,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:56:29,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:56:29,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:56:29,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:56:29,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:56:29,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:56:29,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:56:29,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:56:29,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:56:29,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:56:29,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:56:29,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:56:29,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:56:29,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:56:29,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:56:29,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:56:29,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 13:56:29,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:56:29,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:56:29,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:56:29,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:56:29,881 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:56:29,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:56:29,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:56:29,882 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:56:29,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:56:29,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:56:29,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:56:29,883 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:56:29,883 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:56:29,883 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:56:29,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:56:29,884 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:56:29,884 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 13:56:29,885 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 13:56:29,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:56:29,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:56:29,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:56:29,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:56:29,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:56:29,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:56:29,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:56:29,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:56:29,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:56:29,888 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 13:56:29,888 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 13:56:29,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 13:56:29,888 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-25 13:56:30,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:56:30,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:56:30,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:56:30,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:56:30,185 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:56:30,186 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-25 13:56:30,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f252c8c/a5234d2742464c178ad9d0a937eec311/FLAG09faa1487 [2019-11-25 13:56:30,801 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:56:30,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-25 13:56:30,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f252c8c/a5234d2742464c178ad9d0a937eec311/FLAG09faa1487 [2019-11-25 13:56:31,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f252c8c/a5234d2742464c178ad9d0a937eec311 [2019-11-25 13:56:31,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:56:31,129 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:56:31,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:56:31,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:56:31,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:56:31,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,138 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 25.11 01:56:31, skipping insertion in model container [2019-11-25 13:56:31,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:56:31,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:56:31,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:56:31,629 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 13:56:31,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:56:31,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:56:31,710 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:56:31,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:56:31,852 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:56:31,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31 WrapperNode [2019-11-25 13:56:31,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:56:31,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:56:31,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:56:31,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:56:31,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (1/1) ... [2019-11-25 13:56:31,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:56:31,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:56:31,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:56:31,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:56:31,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (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-25 13:56:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:56:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:56:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:56:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 13:56:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 13:56:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-25 13:56:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-25 13:56:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-25 13:56:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:56:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 13:56:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 13:56:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 13:56:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 13:56:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 13:56:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 13:56:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 13:56:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 13:56:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 13:56:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 13:56:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 13:56:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 13:56:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 13:56:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 13:56:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 13:56:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 13:56:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 13:56:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 13:56:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 13:56:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 13:56:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 13:56:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 13:56:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 13:56:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 13:56:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 13:56:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 13:56:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 13:56:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 13:56:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 13:56:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 13:56:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 13:56:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 13:56:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 13:56:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 13:56:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 13:56:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 13:56:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 13:56:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 13:56:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 13:56:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 13:56:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 13:56:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 13:56:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 13:56:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 13:56:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 13:56:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 13:56:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 13:56:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 13:56:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 13:56:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 13:56:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 13:56:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 13:56:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 13:56:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 13:56:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:56:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 13:56:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:56:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-25 13:56:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 13:56:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 13:56:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 13:56:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 13:56:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 13:56:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 13:56:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 13:56:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 13:56:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 13:56:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 13:56:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 13:56:32,020 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 13:56:32,020 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 13:56:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 13:56:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 13:56:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 13:56:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 13:56:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 13:56:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 13:56:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 13:56:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 13:56:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 13:56:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 13:56:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 13:56:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 13:56:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 13:56:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 13:56:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 13:56:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 13:56:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 13:56:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 13:56:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 13:56:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 13:56:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 13:56:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 13:56:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 13:56:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 13:56:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 13:56:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 13:56:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 13:56:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 13:56:32,025 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 13:56:32,025 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 13:56:32,025 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 13:56:32,025 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 13:56:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 13:56:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 13:56:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 13:56:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:56:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-25 13:56:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:56:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 13:56:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 13:56:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 13:56:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 13:56:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-25 13:56:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:56:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-25 13:56:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:56:32,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 13:56:32,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 13:56:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:56:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:56:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:56:33,255 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:56:33,256 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 13:56:33,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:56:33 BoogieIcfgContainer [2019-11-25 13:56:33,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:56:33,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:56:33,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:56:33,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:56:33,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:56:31" (1/3) ... [2019-11-25 13:56:33,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ab6162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:56:33, skipping insertion in model container [2019-11-25 13:56:33,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:56:31" (2/3) ... [2019-11-25 13:56:33,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ab6162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:56:33, skipping insertion in model container [2019-11-25 13:56:33,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:56:33" (3/3) ... [2019-11-25 13:56:33,266 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-25 13:56:33,276 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:56:33,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-25 13:56:33,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-25 13:56:33,317 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:56:33,317 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:56:33,317 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:56:33,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:56:33,318 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:56:33,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:56:33,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:56:33,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:56:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-25 13:56:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-25 13:56:33,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:33,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:56:33,353 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-25 13:56:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:33,360 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-25 13:56:33,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:33,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925911407] [2019-11-25 13:56:33,372 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-25 13:56:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:33,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-25 13:56:33,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:33,553 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-25 13:56:33,553 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:33,571 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-25 13:56:33,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925911407] [2019-11-25 13:56:33,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:33,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:56:33,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260792752] [2019-11-25 13:56:33,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 13:56:33,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 13:56:33,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 13:56:33,598 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-25 13:56:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:33,633 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-25 13:56:33,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 13:56:33,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-25 13:56:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:33,647 INFO L225 Difference]: With dead ends: 199 [2019-11-25 13:56:33,648 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 13:56:33,649 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-25 13:56:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 13:56:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-25 13:56:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-25 13:56:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-25 13:56:33,708 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-25 13:56:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:33,708 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-25 13:56:33,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 13:56:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-25 13:56:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 13:56:33,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:33,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:56:33,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 13:56:33,931 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-25 13:56:33,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:33,931 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-25 13:56:33,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:33,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989453183] [2019-11-25 13:56:33,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-25 13:56:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:34,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:56:34,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:34,136 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-25 13:56:34,136 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:34,147 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:34,148 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:56:34,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:56:34,203 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:34,204 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-25 13:56:34,205 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:34,232 INFO L588 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-25 13:56:34,233 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-25 13:56:34,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-25 13:56:34,259 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-25 13:56:34,260 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:34,281 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-25 13:56:34,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989453183] [2019-11-25 13:56:34,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:34,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:56:34,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566620244] [2019-11-25 13:56:34,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:56:34,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:34,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:56:34,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:56:34,288 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 5 states. [2019-11-25 13:56:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:35,169 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2019-11-25 13:56:35,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:56:35,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-25 13:56:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:35,172 INFO L225 Difference]: With dead ends: 190 [2019-11-25 13:56:35,173 INFO L226 Difference]: Without dead ends: 190 [2019-11-25 13:56:35,173 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-25 13:56:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-25 13:56:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-25 13:56:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-25 13:56:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 201 transitions. [2019-11-25 13:56:35,188 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 201 transitions. Word has length 9 [2019-11-25 13:56:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:35,189 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 201 transitions. [2019-11-25 13:56:35,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:56:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 201 transitions. [2019-11-25 13:56:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 13:56:35,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:35,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:56:35,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 13:56:35,404 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-25 13:56:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:35,405 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-25 13:56:35,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:35,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967243732] [2019-11-25 13:56:35,406 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-25 13:56:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:35,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 13:56:35,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:35,524 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-25 13:56:35,524 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:35,543 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:35,550 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-25 13:56:35,550 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:35,572 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:35,572 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:56:35,572 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-25 13:56:35,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:56:35,645 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-25 13:56:35,647 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:35,669 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:35,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:56:35,681 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-25 13:56:35,682 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:35,696 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:35,697 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-25 13:56:35,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-25 13:56:35,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-25 13:56:35,731 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:56:36,028 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-25 13:56:36,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967243732] [2019-11-25 13:56:36,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:36,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-25 13:56:36,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208728730] [2019-11-25 13:56:36,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 13:56:36,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:36,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 13:56:36,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:56:36,031 INFO L87 Difference]: Start difference. First operand 190 states and 201 transitions. Second operand 8 states. [2019-11-25 13:56:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:39,806 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-11-25 13:56:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:56:39,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-25 13:56:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:39,811 INFO L225 Difference]: With dead ends: 205 [2019-11-25 13:56:39,811 INFO L226 Difference]: Without dead ends: 205 [2019-11-25 13:56:39,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:56:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-25 13:56:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-25 13:56:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-25 13:56:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2019-11-25 13:56:39,827 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 9 [2019-11-25 13:56:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:39,828 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2019-11-25 13:56:39,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 13:56:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2019-11-25 13:56:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 13:56:39,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:39,829 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:56:40,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 13:56:40,036 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-25 13:56:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-25 13:56:40,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:40,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616982665] [2019-11-25 13:56:40,039 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-25 13:56:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:40,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:56:40,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:40,138 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-25 13:56:40,138 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:40,141 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:40,141 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:56:40,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:56:40,146 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-25 13:56:40,147 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:40,152 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-25 13:56:40,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616982665] [2019-11-25 13:56:40,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:40,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:56:40,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148410987] [2019-11-25 13:56:40,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:56:40,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:56:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:56:40,154 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 3 states. [2019-11-25 13:56:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:40,469 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2019-11-25 13:56:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:56:40,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 13:56:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:40,472 INFO L225 Difference]: With dead ends: 186 [2019-11-25 13:56:40,472 INFO L226 Difference]: Without dead ends: 186 [2019-11-25 13:56:40,472 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-25 13:56:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-25 13:56:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-25 13:56:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-25 13:56:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2019-11-25 13:56:40,483 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 10 [2019-11-25 13:56:40,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:40,484 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2019-11-25 13:56:40,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:56:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2019-11-25 13:56:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 13:56:40,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:40,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:56:40,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 13:56:40,689 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-25 13:56:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-25 13:56:40,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:40,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382890605] [2019-11-25 13:56:40,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 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-25 13:56:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:40,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:56:40,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:40,808 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-25 13:56:40,808 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:40,821 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:40,822 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:56:40,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:56:40,840 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-25 13:56:40,840 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:40,914 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-25 13:56:40,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382890605] [2019-11-25 13:56:40,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:40,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 13:56:40,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397147097] [2019-11-25 13:56:40,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 13:56:40,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:40,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 13:56:40,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 13:56:40,918 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2019-11-25 13:56:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:41,644 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2019-11-25 13:56:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:56:41,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 13:56:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:41,646 INFO L225 Difference]: With dead ends: 184 [2019-11-25 13:56:41,646 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 13:56:41,647 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-25 13:56:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 13:56:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-25 13:56:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-25 13:56:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2019-11-25 13:56:41,657 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2019-11-25 13:56:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:41,658 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2019-11-25 13:56:41,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 13:56:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2019-11-25 13:56:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 13:56:41,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:41,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:56:41,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 13:56:41,870 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-25 13:56:41,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-25 13:56:41,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:41,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436041953] [2019-11-25 13:56:41,872 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-25 13:56:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:41,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 13:56:41,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:41,987 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-25 13:56:41,987 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:42,000 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:42,000 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:56:42,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-25 13:56:42,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:42,065 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-25 13:56:42,066 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:42,075 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:42,075 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:56:42,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2019-11-25 13:56:42,110 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-25 13:56:42,110 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:42,133 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:42,140 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-25 13:56:42,141 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:42,160 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:42,161 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-25 13:56:42,162 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:15 [2019-11-25 13:56:42,189 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-25 13:56:42,190 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:42,198 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:42,201 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-25 13:56:42,201 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:42,206 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:42,206 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-25 13:56:42,206 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-25 13:56:42,221 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-25 13:56:42,222 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:44,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:56:50,455 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-25 13:56:52,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:56:52,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:56:52,679 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:52,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:56:52,686 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:52,687 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:52,687 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-25 13:56:52,687 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:87, output treesize:1 [2019-11-25 13:56:52,694 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-25 13:56:52,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436041953] [2019-11-25 13:56:52,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:52,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-25 13:56:52,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341372129] [2019-11-25 13:56:52,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:56:52,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:52,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:56:52,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=64, Unknown=4, NotChecked=0, Total=90 [2019-11-25 13:56:52,697 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand 10 states. [2019-11-25 13:56:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:54,394 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2019-11-25 13:56:54,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 13:56:54,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-25 13:56:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:54,398 INFO L225 Difference]: With dead ends: 192 [2019-11-25 13:56:54,398 INFO L226 Difference]: Without dead ends: 192 [2019-11-25 13:56:54,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=35, Invalid=93, Unknown=4, NotChecked=0, Total=132 [2019-11-25 13:56:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-25 13:56:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-11-25 13:56:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-25 13:56:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2019-11-25 13:56:54,410 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 15 [2019-11-25 13:56:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:54,410 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2019-11-25 13:56:54,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:56:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2019-11-25 13:56:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:56:54,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:54,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:56:54,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 13:56:54,620 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-25 13:56:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:54,622 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-25 13:56:54,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:54,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715600341] [2019-11-25 13:56:54,622 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-25 13:56:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:54,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 13:56:54,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:54,787 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-25 13:56:54,788 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:54,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:56:54,801 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-25 13:56:54,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715600341] [2019-11-25 13:56:54,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:54,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:56:54,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660406305] [2019-11-25 13:56:54,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 13:56:54,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 13:56:54,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 13:56:54,803 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 4 states. [2019-11-25 13:56:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:54,840 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2019-11-25 13:56:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:56:54,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-25 13:56:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:54,843 INFO L225 Difference]: With dead ends: 268 [2019-11-25 13:56:54,843 INFO L226 Difference]: Without dead ends: 268 [2019-11-25 13:56:54,843 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-25 13:56:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-25 13:56:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2019-11-25 13:56:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 13:56:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2019-11-25 13:56:54,852 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 17 [2019-11-25 13:56:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:54,852 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2019-11-25 13:56:54,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 13:56:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2019-11-25 13:56:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 13:56:54,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:54,853 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-25 13:56:55,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 13:56:55,060 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-25 13:56:55,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-25 13:56:55,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:55,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85778239] [2019-11-25 13:56:55,064 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-25 13:56:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:55,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 13:56:55,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:55,177 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_155|]} [2019-11-25 13:56:55,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:56:55,184 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-25 13:56:55,185 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:55,196 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:55,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:56:55,201 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-25 13:56:55,202 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:55,210 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:55,211 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-25 13:56:55,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-25 13:56:55,224 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-25 13:56:55,224 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:55,276 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-25 13:56:55,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85778239] [2019-11-25 13:56:55,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:55,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 13:56:55,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662370176] [2019-11-25 13:56:55,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 13:56:55,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:55,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 13:56:55,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 13:56:55,279 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand 4 states. [2019-11-25 13:56:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:56,312 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2019-11-25 13:56:56,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 13:56:56,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-25 13:56:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:56,315 INFO L225 Difference]: With dead ends: 267 [2019-11-25 13:56:56,315 INFO L226 Difference]: Without dead ends: 267 [2019-11-25 13:56:56,315 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-25 13:56:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-25 13:56:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 223. [2019-11-25 13:56:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-25 13:56:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2019-11-25 13:56:56,324 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 18 [2019-11-25 13:56:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:56,325 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2019-11-25 13:56:56,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 13:56:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2019-11-25 13:56:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 13:56:56,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:56,326 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-25 13:56:56,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 13:56:56,531 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-25 13:56:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:56,531 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-25 13:56:56,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:56,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382686884] [2019-11-25 13:56:56,533 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-25 13:56:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:56,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:56:56,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:56,654 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 13:56:56,655 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-25 13:56:56,655 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:56,662 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:56,663 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-25 13:56:56,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-25 13:56:56,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-25 13:56:56,677 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:56,685 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-25 13:56:56,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382686884] [2019-11-25 13:56:56,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:56,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:56:56,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322720681] [2019-11-25 13:56:56,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:56:56,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:56:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:56:56,687 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand 3 states. [2019-11-25 13:56:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:57,014 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-25 13:56:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:56:57,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 13:56:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:57,017 INFO L225 Difference]: With dead ends: 226 [2019-11-25 13:56:57,017 INFO L226 Difference]: Without dead ends: 226 [2019-11-25 13:56:57,017 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-25 13:56:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-25 13:56:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2019-11-25 13:56:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-25 13:56:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-11-25 13:56:57,024 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 18 [2019-11-25 13:56:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:57,024 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-25 13:56:57,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:56:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2019-11-25 13:56:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:56:57,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:57,025 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-25 13:56:57,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 13:56:57,236 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-25 13:56:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-25 13:56:57,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:57,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913812596] [2019-11-25 13:56:57,238 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-25 13:56:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:57,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 13:56:57,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:57,363 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 13:56:57,363 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-25 13:56:57,363 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:57,367 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:57,368 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-25 13:56:57,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-25 13:56:57,388 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-25 13:56:57,388 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:57,403 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:57,404 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-25 13:56:57,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-25 13:56:57,417 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-25 13:56:57,418 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:57,420 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:57,420 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-25 13:56:57,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-25 13:56:57,430 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-25 13:56:57,431 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:57,444 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-25 13:56:57,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913812596] [2019-11-25 13:56:57,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:57,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:56:57,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896229286] [2019-11-25 13:56:57,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:56:57,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:57,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:56:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:56:57,447 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand 5 states. [2019-11-25 13:56:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:58,104 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-25 13:56:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:56:58,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 13:56:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:58,108 INFO L225 Difference]: With dead ends: 226 [2019-11-25 13:56:58,108 INFO L226 Difference]: Without dead ends: 226 [2019-11-25 13:56:58,109 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-25 13:56:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-25 13:56:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2019-11-25 13:56:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-25 13:56:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2019-11-25 13:56:58,119 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 22 [2019-11-25 13:56:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:58,121 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2019-11-25 13:56:58,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:56:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2019-11-25 13:56:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:56:58,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:58,123 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-25 13:56:58,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 13:56:58,338 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-25 13:56:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-25 13:56:58,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:58,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121072523] [2019-11-25 13:56:58,340 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-25 13:56:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:58,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 13:56:58,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:58,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:58,503 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-25 13:56:58,503 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:58,535 INFO L588 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-25 13:56:58,536 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-25 13:56:58,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-25 13:56:58,552 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-25 13:56:58,553 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:58,569 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:58,573 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-25 13:56:58,573 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:58,585 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:58,586 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-25 13:56:58,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-25 13:56:58,634 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-25 13:56:58,635 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:58,647 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:58,652 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-25 13:56:58,652 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:58,662 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:58,663 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-25 13:56:58,663 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:14 [2019-11-25 13:56:58,680 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-25 13:56:58,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:59,002 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-25 13:56:59,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121072523] [2019-11-25 13:56:59,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:56:59,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 13:56:59,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497255477] [2019-11-25 13:56:59,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:56:59,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:56:59,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:56:59,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:56:59,004 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 10 states. [2019-11-25 13:57:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:57:02,346 INFO L93 Difference]: Finished difference Result 318 states and 374 transitions. [2019-11-25 13:57:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 13:57:02,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-25 13:57:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:57:02,350 INFO L225 Difference]: With dead ends: 318 [2019-11-25 13:57:02,350 INFO L226 Difference]: Without dead ends: 318 [2019-11-25 13:57:02,351 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-25 13:57:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-25 13:57:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 232. [2019-11-25 13:57:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 13:57:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-11-25 13:57:02,360 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 22 [2019-11-25 13:57:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:57:02,361 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-11-25 13:57:02,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:57:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-11-25 13:57:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:57:02,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:57:02,363 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-25 13:57:02,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 13:57:02,566 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-25 13:57:02,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:57:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-25 13:57:02,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:57:02,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049647759] [2019-11-25 13:57:02,568 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-25 13:57:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:57:02,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 13:57:02,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:57:02,776 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_174|]} [2019-11-25 13:57:02,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:57:02,782 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-25 13:57:02,782 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:57:02,792 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:57:02,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:57:02,823 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-25 13:57:02,823 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:57:02,833 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:57:02,833 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:57:02,833 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-25 13:57:02,856 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-25 13:57:02,856 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:57:02,877 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:57:02,882 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-25 13:57:02,883 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:57:02,900 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:57:02,925 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-25 13:57:02,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-11-25 13:57:03,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:57:03,070 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-25 13:57:03,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:03,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:03,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:03,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:03,076 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-25 13:57:03,266 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-11-25 13:57:03,267 INFO L588 ElimStorePlain]: treesize reduction 357, result has 22.4 percent of original size [2019-11-25 13:57:03,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:57:03,278 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-25 13:57:03,279 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:57:03,316 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:57:03,317 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-25 13:57:03,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2019-11-25 13:57:09,380 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-25 13:57:11,484 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-25 13:57:13,563 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-25 13:57:14,098 WARN L192 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-25 13:57:14,099 INFO L343 Elim1Store]: treesize reduction 18, result has 92.4 percent of original size [2019-11-25 13:57:14,100 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-25 13:57:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:57:14,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:57:14,661 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 19 xjuncts. [2019-11-25 13:59:48,345 WARN L192 SmtUtils]: Spent 2.56 m on a formula simplification. DAG size of input: 431 DAG size of output: 65 [2019-11-25 13:59:48,346 INFO L588 ElimStorePlain]: treesize reduction 76696, result has 0.6 percent of original size [2019-11-25 13:59:48,821 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-25 13:59:48,822 INFO L343 Elim1Store]: treesize reduction 18, result has 93.9 percent of original size [2019-11-25 13:59:48,822 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-25 13:59:48,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:59:48,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:59:48,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:59:48,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:59:48,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:59:48,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:59:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:59:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:59:48,848 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-25 14:00:41,126 WARN L192 SmtUtils]: Spent 52.28 s on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2019-11-25 14:00:41,128 INFO L588 ElimStorePlain]: treesize reduction 7751, result has 9.0 percent of original size [2019-11-25 14:00:41,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 14:00:41,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,145 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-25 14:00:41,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:180, output treesize:720 [2019-11-25 14:00:41,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 14:00:41,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:55,375 WARN L192 SmtUtils]: Spent 8.09 s on a formula simplification that was a NOOP. DAG size: 94 [2019-11-25 14:00:55,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:55,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 14:00:55,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:55,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:55,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:55,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:55,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:00:55,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:03:57,560 WARN L192 SmtUtils]: Spent 2.86 m on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-11-25 14:05:23,175 WARN L192 SmtUtils]: Spent 1.42 m on a formula simplification that was a NOOP. DAG size: 138 [2019-11-25 14:05:23,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 14:05:23,197 INFO L404 ElimStorePlain]: Different costs {90=[|#memory_$Pointer$.offset|], 380=[|#memory_$Pointer$.base|]} [2019-11-25 14:05:23,285 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-25 14:05:23,286 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:23,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:23,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:23,418 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-25 14:05:23,418 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:23,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:23,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:23,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:23,588 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-25 14:05:23,588 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:23,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:23,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:23,651 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-25 14:05:23,651 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:23,701 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-25 14:05:23,701 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:23,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:23,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:23,763 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-25 14:05:23,764 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:24,472 WARN L192 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-25 14:05:24,473 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:24,607 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-25 14:05:24,607 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-25 14:05:24,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:24,609 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:24,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:24,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:24,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:24,803 INFO L237 Elim1Store]: Index analysis took 157 ms [2019-11-25 14:05:25,005 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-25 14:05:25,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:25,005 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-25 14:05:25,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,014 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:25,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:25,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:25,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:05:25,232 INFO L237 Elim1Store]: Index analysis took 172 ms [2019-11-25 14:05:25,533 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-25 14:05:25,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:25,534 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-25 14:05:25,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:25,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,549 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:25,731 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-25 14:05:25,732 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-25 14:05:25,733 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-25 14:05:25,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:25,735 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:25,998 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-25 14:05:25,999 INFO L343 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2019-11-25 14:05:25,999 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-25 14:05:26,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:26,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:26,001 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:26,329 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-11-25 14:05:26,330 INFO L343 Elim1Store]: treesize reduction 108, result has 41.6 percent of original size [2019-11-25 14:05:26,330 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-25 14:05:26,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:26,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:05:26,332 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:26,414 INFO L588 ElimStorePlain]: treesize reduction 61, result has 25.6 percent of original size [2019-11-25 14:05:26,415 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-25 14:05:26,415 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:807, output treesize:21 [2019-11-25 14:05:26,629 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-25 14:05:26,629 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 14:05:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:27,277 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-25 14:05:27,286 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-25 14:05:27,413 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-25 14:05:27,414 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:27,422 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-25 14:05:27,435 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-25 14:05:27,563 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-25 14:05:27,563 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:27,564 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-25 14:05:27,564 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:139 [2019-11-25 14:05:34,790 WARN L192 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-25 14:05:40,383 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-25 14:05:47,045 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-25 14:05:47,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:47,073 INFO L404 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_72|], 6=[|v_#memory_$Pointer$.base_73|]} [2019-11-25 14:05:47,089 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-25 14:05:47,113 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-25 14:05:47,796 WARN L192 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-25 14:05:47,796 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:47,811 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-25 14:05:47,825 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-25 14:05:48,378 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-25 14:05:48,378 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:48,380 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-25 14:05:48,380 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:304, output treesize:544 [2019-11-25 14:06:04,108 WARN L192 SmtUtils]: Spent 4.55 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-25 14:06:06,147 WARN L838 $PredicateComparison]: unable to prove that (and (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 ((.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)) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse10 (store (select |c_#memory_$Pointer$.base| .cse7) (bvadd .cse4 v_prenex_14 (_ bv1 32)) v_DerPreprocessor_7))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 .cse10))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (let ((.cse1 (bvadd v_prenex_12 .cse4 (_ bv4 32))) (.cse2 (store (select |c_#memory_$Pointer$.offset| .cse7) (bvadd .cse4 v_prenex_14 (_ bv3 32)) v_DerPreprocessor_5)) (.cse0 (store (select .cse9 .cse6) (bvadd v_prenex_12 .cse4 (_ bv6 32)) v_DerPreprocessor_2)) (.cse3 (bvadd .cse4 v_prenex_14))) (or (not (= (select .cse0 .cse1) v_DerPreprocessor_2)) (not (= v_DerPreprocessor_5 (select .cse2 .cse3))) (bvule (bvadd .cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse7 .cse2))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse1 v_DerPreprocessor_3))) c_create_data_~data~0.base) .cse8) (_ bv12 32)) (select |c_#length| (select (select (store .cse9 .cse6 .cse0) c_create_data_~data~0.base) .cse8))) (not (= v_DerPreprocessor_7 (select .cse10 .cse3))))))))))) (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 ((.cse20 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse20)) (.cse15 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse21 (store (select |c_#memory_$Pointer$.base| .cse19) (bvadd .cse15 |create_data_#t~mem8.offset| (_ bv1 32)) v_DerPreprocessor_8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse19 .cse21))) (let ((.cse14 (select (select .cse13 c_create_data_~data~0.base) .cse20)) (.cse16 (bvadd .cse15 v_prenex_13 (_ bv4 32))) (.cse11 (store (select |c_#memory_$Pointer$.offset| .cse19) (bvadd .cse15 |create_data_#t~mem8.offset| (_ bv3 32)) v_DerPreprocessor_6)) (.cse12 (bvadd .cse15 |create_data_#t~mem8.offset|))) (or (not (= v_DerPreprocessor_6 (select .cse11 .cse12))) (not (= v_DerPreprocessor_1 (select (store (select .cse13 .cse14) (bvadd .cse15 v_prenex_13 (_ bv6 32)) v_DerPreprocessor_1) .cse16))) (let ((.cse17 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| .cse19 .cse11))) (store .cse18 .cse14 (store (select .cse18 .cse14) .cse16 v_DerPreprocessor_4))) c_create_data_~data~0.base) .cse20))) (bvule (bvadd .cse17 .cse15 (_ bv8 32)) (bvadd .cse17 .cse15 (_ bv12 32)))) (not (= (select .cse21 .cse12) v_DerPreprocessor_8)))))))))) is different from false [2019-11-25 14:06:08,333 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-25 14:06:08,376 INFO L404 ElimStorePlain]: Different costs {5=[v_prenex_16, |#memory_$Pointer$.offset|], 6=[v_prenex_15], 9=[|#memory_$Pointer$.base|]} [2019-11-25 14:06:08,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:08,678 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-25 14:06:08,976 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:08,976 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-25 14:06:08,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:09,023 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 14:06:09,027 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_64], 1=[v_arrayElimCell_65]} [2019-11-25 14:06:09,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 14:06:09,332 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:351) 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-25 14:06:09,340 INFO L168 Benchmark]: Toolchain (without parser) took 578210.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.1 MB). Free memory was 963.1 MB in the beginning and 862.8 MB in the end (delta: 100.3 MB). Peak memory consumption was 361.4 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:09,340 INFO L168 Benchmark]: CDTParser took 0.29 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-25 14:06:09,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:09,341 INFO L168 Benchmark]: Boogie Preprocessor took 86.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 14:06:09,341 INFO L168 Benchmark]: RCFGBuilder took 1317.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.5 MB). Peak memory consumption was 90.5 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:09,342 INFO L168 Benchmark]: TraceAbstraction took 576078.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.0 GB in the beginning and 862.8 MB in the end (delta: 163.8 MB). Peak memory consumption was 276.6 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:09,347 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.29 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 723.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1317.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.5 MB). Peak memory consumption was 90.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 576078.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.0 GB in the beginning and 862.8 MB in the end (delta: 163.8 MB). Peak memory consumption was 276.6 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...