./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 3d056a1f 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: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 14:25:05,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:25:05,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:25:05,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:25:05,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:25:05,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:25:05,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:25:05,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:25:05,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:25:05,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:25:05,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:25:05,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:25:05,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:25:05,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:25:05,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:25:05,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:25:05,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:25:05,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:25:05,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:25:05,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:25:05,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:25:05,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:25:05,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:25:05,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:25:05,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:25:05,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:25:05,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:25:05,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:25:05,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:25:05,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:25:05,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:25:05,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:25:05,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:25:05,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:25:05,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:25:05,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:25:05,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:25:05,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:25:05,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:25:05,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:25:05,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:25:05,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-22 14:25:05,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:25:05,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:25:05,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:25:05,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:25:05,556 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:25:05,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:25:05,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:25:05,557 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:25:05,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:25:05,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:25:05,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:25:05,558 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:25:05,558 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:25:05,558 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:25:05,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:25:05,559 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:25:05,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:25:05,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:25:05,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:25:05,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:25:05,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:25:05,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:25:05,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:25:05,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:25:05,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:25:05,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:25:05,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:25:05,562 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-22 14:25:05,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:25:05,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:25:05,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:25:05,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:25:05,871 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:25:05,871 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-22 14:25:05,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7abc90ce/27b09c043cf74ac6bc2fe0f5cc716a04/FLAG6e84a35d9 [2019-11-22 14:25:06,467 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:25:06,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-22 14:25:06,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7abc90ce/27b09c043cf74ac6bc2fe0f5cc716a04/FLAG6e84a35d9 [2019-11-22 14:25:06,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7abc90ce/27b09c043cf74ac6bc2fe0f5cc716a04 [2019-11-22 14:25:06,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:25:06,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:25:06,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:25:06,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:25:06,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:25:06,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:06" (1/1) ... [2019-11-22 14:25:06,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425552f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:06, skipping insertion in model container [2019-11-22 14:25:06,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:06" (1/1) ... [2019-11-22 14:25:06,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:25:06,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:25:07,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:25:07,267 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-22 14:25:07,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2fa5317f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:07, skipping insertion in model container [2019-11-22 14:25:07,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:25:07,268 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-22 14:25:07,271 INFO L168 Benchmark]: Toolchain (without parser) took 499.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-22 14:25:07,272 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:25:07,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-22 14:25:07,275 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 496.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 15.1 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-3d056a1 [2019-11-22 14:25:09,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:25:09,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:25:09,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:25:09,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:25:09,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:25:09,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:25:09,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:25:09,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:25:09,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:25:09,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:25:09,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:25:09,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:25:09,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:25:09,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:25:09,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:25:09,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:25:09,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:25:09,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:25:09,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:25:09,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:25:09,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:25:09,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:25:09,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:25:09,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:25:09,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:25:09,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:25:09,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:25:09,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:25:09,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:25:09,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:25:09,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:25:09,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:25:09,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:25:09,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:25:09,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:25:09,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:25:09,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:25:09,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:25:09,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:25:09,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:25:09,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-22 14:25:09,111 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:25:09,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:25:09,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:25:09,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:25:09,114 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:25:09,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:25:09,114 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:25:09,114 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:25:09,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:25:09,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:25:09,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:25:09,116 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:25:09,116 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:25:09,117 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:25:09,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:25:09,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:25:09,117 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 14:25:09,117 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 14:25:09,118 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:25:09,118 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:25:09,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:25:09,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:25:09,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:25:09,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:25:09,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:25:09,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:25:09,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:25:09,119 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 14:25:09,120 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 14:25:09,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 14:25:09,120 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-22 14:25:09,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:25:09,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:25:09,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:25:09,459 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:25:09,459 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:25:09,460 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-22 14:25:09,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d86be1d/968f1cd5c2d04cc1a05c697787ffba54/FLAGcd4494781 [2019-11-22 14:25:09,967 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:25:09,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-22 14:25:09,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d86be1d/968f1cd5c2d04cc1a05c697787ffba54/FLAGcd4494781 [2019-11-22 14:25:10,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d86be1d/968f1cd5c2d04cc1a05c697787ffba54 [2019-11-22 14:25:10,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:25:10,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:25:10,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:25:10,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:25:10,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:25:10,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:10" (1/1) ... [2019-11-22 14:25:10,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4551df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:10, skipping insertion in model container [2019-11-22 14:25:10,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:10" (1/1) ... [2019-11-22 14:25:10,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:25:10,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:25:10,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:25:10,818 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-22 14:25:10,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:25:10,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:25:10,906 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:25:10,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:25:11,052 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:25:11,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11 WrapperNode [2019-11-22 14:25:11,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:25:11,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:25:11,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:25:11,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:25:11,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (1/1) ... [2019-11-22 14:25:11,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (1/1) ... [2019-11-22 14:25:11,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (1/1) ... [2019-11-22 14:25:11,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (1/1) ... [2019-11-22 14:25:11,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (1/1) ... [2019-11-22 14:25:11,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (1/1) ... [2019-11-22 14:25:11,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (1/1) ... [2019-11-22 14:25:11,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:25:11,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:25:11,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:25:11,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:25:11,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (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-22 14:25:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:25:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:25:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 14:25:11,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 14:25:11,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 14:25:11,212 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-22 14:25:11,212 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-22 14:25:11,213 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-22 14:25:11,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:25:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 14:25:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 14:25:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 14:25:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 14:25:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 14:25:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 14:25:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 14:25:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 14:25:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 14:25:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 14:25:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 14:25:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 14:25:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 14:25:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 14:25:11,219 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 14:25:11,219 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 14:25:11,219 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 14:25:11,220 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 14:25:11,220 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 14:25:11,220 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 14:25:11,220 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 14:25:11,220 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 14:25:11,221 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 14:25:11,221 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 14:25:11,221 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 14:25:11,221 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 14:25:11,221 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 14:25:11,222 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 14:25:11,222 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 14:25:11,222 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 14:25:11,222 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 14:25:11,222 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 14:25:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 14:25:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 14:25:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 14:25:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 14:25:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 14:25:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 14:25:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 14:25:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 14:25:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 14:25:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 14:25:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 14:25:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 14:25:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 14:25:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 14:25:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 14:25:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 14:25:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 14:25:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 14:25:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 14:25:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 14:25:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 14:25:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 14:25:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:25:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 14:25:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:25:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 14:25:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 14:25:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 14:25:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 14:25:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 14:25:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 14:25:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 14:25:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 14:25:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 14:25:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 14:25:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 14:25:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 14:25:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 14:25:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 14:25:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 14:25:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 14:25:11,235 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 14:25:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 14:25:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 14:25:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 14:25:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 14:25:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 14:25:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 14:25:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 14:25:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 14:25:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 14:25:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 14:25:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 14:25:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 14:25:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 14:25:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 14:25:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 14:25:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 14:25:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 14:25:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 14:25:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 14:25:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 14:25:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 14:25:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 14:25:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 14:25:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 14:25:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 14:25:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 14:25:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 14:25:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 14:25:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 14:25:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 14:25:11,244 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 14:25:11,244 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 14:25:11,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 14:25:11,244 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-22 14:25:11,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:25:11,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 14:25:11,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 14:25:11,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 14:25:11,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 14:25:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-22 14:25:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:25:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-22 14:25:11,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:25:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 14:25:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 14:25:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:25:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:25:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 14:25:12,528 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:25:12,529 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-22 14:25:12,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:25:12 BoogieIcfgContainer [2019-11-22 14:25:12,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:25:12,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:25:12,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:25:12,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:25:12,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:25:10" (1/3) ... [2019-11-22 14:25:12,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277747ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:25:12, skipping insertion in model container [2019-11-22 14:25:12,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:11" (2/3) ... [2019-11-22 14:25:12,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277747ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:25:12, skipping insertion in model container [2019-11-22 14:25:12,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:25:12" (3/3) ... [2019-11-22 14:25:12,540 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-22 14:25:12,549 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:25:12,559 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-22 14:25:12,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-22 14:25:12,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:25:12,596 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:25:12,596 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:25:12,597 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:25:12,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:25:12,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:25:12,598 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:25:12,598 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:25:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-22 14:25:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-22 14:25:12,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:12,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:12,647 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-22 14:25:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-22 14:25:12,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:12,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [625353885] [2019-11-22 14:25:12,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:12,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-22 14:25:12,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:12,930 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-22 14:25:12,931 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:12,950 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-22 14:25:12,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [625353885] [2019-11-22 14:25:12,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:12,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 14:25:12,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550922567] [2019-11-22 14:25:12,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-22 14:25:12,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:12,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-22 14:25:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 14:25:12,980 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-22 14:25:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:13,016 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-22 14:25:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-22 14:25:13,018 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-22 14:25:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:13,031 INFO L225 Difference]: With dead ends: 199 [2019-11-22 14:25:13,031 INFO L226 Difference]: Without dead ends: 196 [2019-11-22 14:25:13,033 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-22 14:25:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-22 14:25:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-22 14:25:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 14:25:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-22 14:25:13,091 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-22 14:25:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:13,092 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-22 14:25:13,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-22 14:25:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-22 14:25:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 14:25:13,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:13,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:13,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:13,299 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-22 14:25:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:13,300 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-22 14:25:13,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:13,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1984574902] [2019-11-22 14:25:13,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:13,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 14:25:13,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:13,545 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-22 14:25:13,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:13,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:13,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:13,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:25:13,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:13,618 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 14 treesize of output 16 [2019-11-22 14:25:13,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:13,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:13,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:25:13,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-22 14:25:13,672 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-22 14:25:13,672 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:13,752 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-22 14:25:13,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1984574902] [2019-11-22 14:25:13,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:13,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 14:25:13,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526204415] [2019-11-22 14:25:13,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:25:13,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:25:13,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:25:13,756 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 8 states. [2019-11-22 14:25:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:15,605 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2019-11-22 14:25:15,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:25:15,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 14:25:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:15,612 INFO L225 Difference]: With dead ends: 213 [2019-11-22 14:25:15,612 INFO L226 Difference]: Without dead ends: 213 [2019-11-22 14:25:15,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:25:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-22 14:25:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-11-22 14:25:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-22 14:25:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2019-11-22 14:25:15,630 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 9 [2019-11-22 14:25:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:15,630 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2019-11-22 14:25:15,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:25:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2019-11-22 14:25:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 14:25:15,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:15,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:15,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:15,837 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-22 14:25:15,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:15,837 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-22 14:25:15,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:15,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [46503025] [2019-11-22 14:25:15,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:16,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:25:16,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:16,061 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-22 14:25:16,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:16,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:16,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:16,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 14:25:16,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:16,130 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-22 14:25:16,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:16,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:16,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:25:16,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:22 [2019-11-22 14:25:16,178 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-22 14:25:16,179 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:16,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:16,410 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-22 14:25:16,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [46503025] [2019-11-22 14:25:16,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:16,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 14:25:16,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926646726] [2019-11-22 14:25:16,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:25:16,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:25:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:25:16,413 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 8 states. [2019-11-22 14:25:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:18,720 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2019-11-22 14:25:18,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:25:18,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 14:25:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:18,723 INFO L225 Difference]: With dead ends: 210 [2019-11-22 14:25:18,723 INFO L226 Difference]: Without dead ends: 210 [2019-11-22 14:25:18,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:25:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-22 14:25:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2019-11-22 14:25:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 14:25:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2019-11-22 14:25:18,737 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 9 [2019-11-22 14:25:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:18,737 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2019-11-22 14:25:18,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:25:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2019-11-22 14:25:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:25:18,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:18,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:18,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:18,945 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-22 14:25:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-22 14:25:18,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:18,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1214084607] [2019-11-22 14:25:18,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:19,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 14:25:19,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:19,119 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-22 14:25:19,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:19,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:19,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:19,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 14:25:19,139 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-22 14:25:19,139 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:19,161 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-22 14:25:19,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1214084607] [2019-11-22 14:25:19,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:19,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-22 14:25:19,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319709036] [2019-11-22 14:25:19,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:19,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:19,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:19,164 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 4 states. [2019-11-22 14:25:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:19,530 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2019-11-22 14:25:19,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:25:19,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 14:25:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:19,533 INFO L225 Difference]: With dead ends: 194 [2019-11-22 14:25:19,533 INFO L226 Difference]: Without dead ends: 194 [2019-11-22 14:25:19,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-22 14:25:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-22 14:25:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-22 14:25:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2019-11-22 14:25:19,555 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 10 [2019-11-22 14:25:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:19,555 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2019-11-22 14:25:19,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2019-11-22 14:25:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:25:19,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:19,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:19,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:19,758 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-22 14:25:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-22 14:25:19,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:19,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [534220970] [2019-11-22 14:25:19,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:19,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 14:25:19,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:19,941 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-22 14:25:19,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:19,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:19,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:19,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:25:19,957 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-22 14:25:19,957 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:20,001 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-22 14:25:20,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534220970] [2019-11-22 14:25:20,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:20,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 14:25:20,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842445114] [2019-11-22 14:25:20,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:20,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:20,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:20,004 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 4 states. [2019-11-22 14:25:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:20,677 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2019-11-22 14:25:20,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:25:20,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 14:25:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:20,683 INFO L225 Difference]: With dead ends: 192 [2019-11-22 14:25:20,683 INFO L226 Difference]: Without dead ends: 192 [2019-11-22 14:25:20,683 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-22 14:25:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-22 14:25:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-22 14:25:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-22 14:25:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2019-11-22 14:25:20,691 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 10 [2019-11-22 14:25:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:20,691 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2019-11-22 14:25:20,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2019-11-22 14:25:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 14:25:20,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:20,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:20,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:20,896 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-22 14:25:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-22 14:25:20,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:20,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [804175863] [2019-11-22 14:25:20,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:21,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 14:25:21,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:21,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:21,227 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-22 14:25:21,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:21,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:21,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:21,282 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-22 14:25:21,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:21,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:21,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:25:21,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:50, output treesize:24 [2019-11-22 14:25:21,373 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-22 14:25:21,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:21,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:21,402 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-22 14:25:21,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:21,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:21,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:21,423 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2019-11-22 14:25:21,437 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-22 14:25:21,437 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:23,905 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-22 14:25:23,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [804175863] [2019-11-22 14:25:23,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:23,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-22 14:25:23,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768178815] [2019-11-22 14:25:23,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 14:25:23,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:23,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 14:25:23,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:25:23,907 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand 11 states. [2019-11-22 14:25:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:25,367 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2019-11-22 14:25:25,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 14:25:25,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-22 14:25:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:25,370 INFO L225 Difference]: With dead ends: 197 [2019-11-22 14:25:25,370 INFO L226 Difference]: Without dead ends: 197 [2019-11-22 14:25:25,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:25:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-22 14:25:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-11-22 14:25:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 14:25:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2019-11-22 14:25:25,377 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 15 [2019-11-22 14:25:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:25,377 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2019-11-22 14:25:25,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 14:25:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2019-11-22 14:25:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 14:25:25,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:25,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:25,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:25,582 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-22 14:25:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:25,582 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-22 14:25:25,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:25,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [7080265] [2019-11-22 14:25:25,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:25,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 14:25:25,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:25,812 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-22 14:25:25,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:25,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:25,830 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-22 14:25:25,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7080265] [2019-11-22 14:25:25,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:25,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 14:25:25,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023814288] [2019-11-22 14:25:25,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:25,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:25,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:25,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:25,834 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 4 states. [2019-11-22 14:25:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:25,879 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2019-11-22 14:25:25,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:25:25,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-22 14:25:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:25,881 INFO L225 Difference]: With dead ends: 273 [2019-11-22 14:25:25,882 INFO L226 Difference]: Without dead ends: 273 [2019-11-22 14:25:25,882 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-22 14:25:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-22 14:25:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 237. [2019-11-22 14:25:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-22 14:25:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2019-11-22 14:25:25,895 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 17 [2019-11-22 14:25:25,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:25,895 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2019-11-22 14:25:25,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2019-11-22 14:25:25,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 14:25:25,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:25,897 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-22 14:25:26,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:26,108 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-22 14:25:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-22 14:25:26,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:26,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [75148606] [2019-11-22 14:25:26,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:26,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 14:25:26,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:26,398 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_151|]} [2019-11-22 14:25:26,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:26,408 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-22 14:25:26,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:26,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:26,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:26,429 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-22 14:25:26,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:26,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:26,442 INFO L496 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-22 14:25:26,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-22 14:25:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:25:26,457 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:26,508 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-22 14:25:26,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [75148606] [2019-11-22 14:25:26,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:26,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 14:25:26,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157291583] [2019-11-22 14:25:26,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:26,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:26,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:26,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:26,512 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand 4 states. [2019-11-22 14:25:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:27,581 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2019-11-22 14:25:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 14:25:27,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 14:25:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:27,585 INFO L225 Difference]: With dead ends: 272 [2019-11-22 14:25:27,585 INFO L226 Difference]: Without dead ends: 272 [2019-11-22 14:25:27,586 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-22 14:25:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-22 14:25:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 228. [2019-11-22 14:25:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-22 14:25:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 271 transitions. [2019-11-22 14:25:27,594 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 271 transitions. Word has length 18 [2019-11-22 14:25:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:27,594 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 271 transitions. [2019-11-22 14:25:27,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 271 transitions. [2019-11-22 14:25:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 14:25:27,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:27,595 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-22 14:25:27,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:27,798 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-22 14:25:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-22 14:25:27,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:27,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1205792459] [2019-11-22 14:25:27,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:28,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 14:25:28,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:28,048 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-22 14:25:28,049 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 19 treesize of output 18 [2019-11-22 14:25:28,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:28,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:28,058 INFO L496 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-22 14:25:28,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-22 14:25:28,078 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-22 14:25:28,078 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:28,096 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-22 14:25:28,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1205792459] [2019-11-22 14:25:28,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:28,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 14:25:28,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304490744] [2019-11-22 14:25:28,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:28,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:28,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:28,098 INFO L87 Difference]: Start difference. First operand 228 states and 271 transitions. Second operand 4 states. [2019-11-22 14:25:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:28,576 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2019-11-22 14:25:28,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 14:25:28,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 14:25:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:28,578 INFO L225 Difference]: With dead ends: 256 [2019-11-22 14:25:28,579 INFO L226 Difference]: Without dead ends: 256 [2019-11-22 14:25:28,579 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-22 14:25:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-22 14:25:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 222. [2019-11-22 14:25:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-22 14:25:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 261 transitions. [2019-11-22 14:25:28,586 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 261 transitions. Word has length 18 [2019-11-22 14:25:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:28,587 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 261 transitions. [2019-11-22 14:25:28,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 261 transitions. [2019-11-22 14:25:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 14:25:28,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:28,588 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-22 14:25:28,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:28,791 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-22 14:25:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-22 14:25:28,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:28,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [408236176] [2019-11-22 14:25:28,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:29,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 14:25:29,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:29,027 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-22 14:25:29,027 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-22 14:25:29,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:29,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:29,034 INFO L496 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-22 14:25:29,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-22 14:25:29,052 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-22 14:25:29,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:29,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:29,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:29,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-22 14:25:29,080 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-22 14:25:29,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:29,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:29,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:29,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-22 14:25:29,095 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-22 14:25:29,095 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:29,103 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-22 14:25:29,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [408236176] [2019-11-22 14:25:29,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:29,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 14:25:29,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628921366] [2019-11-22 14:25:29,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:25:29,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:25:29,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:25:29,104 INFO L87 Difference]: Start difference. First operand 222 states and 261 transitions. Second operand 5 states. [2019-11-22 14:25:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:29,851 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2019-11-22 14:25:29,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:25:29,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-22 14:25:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:29,854 INFO L225 Difference]: With dead ends: 231 [2019-11-22 14:25:29,854 INFO L226 Difference]: Without dead ends: 231 [2019-11-22 14:25:29,854 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-22 14:25:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-22 14:25:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2019-11-22 14:25:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-22 14:25:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 259 transitions. [2019-11-22 14:25:29,861 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 259 transitions. Word has length 22 [2019-11-22 14:25:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:29,862 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 259 transitions. [2019-11-22 14:25:29,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:25:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 259 transitions. [2019-11-22 14:25:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 14:25:29,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:29,863 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-22 14:25:30,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:30,068 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-22 14:25:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-22 14:25:30,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:30,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1150946823] [2019-11-22 14:25:30,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:30,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 14:25:30,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:30,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:30,348 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-22 14:25:30,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:30,373 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-22 14:25:30,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:30,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-22 14:25:30,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-22 14:25:30,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:30,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:30,408 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-22 14:25:30,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:30,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:30,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:30,423 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-22 14:25:30,468 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-22 14:25:30,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:30,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:30,485 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-22 14:25:30,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:30,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:30,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:30,492 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:14 [2019-11-22 14:25:30,515 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-22 14:25:30,515 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:30,826 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-22 14:25:30,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1150946823] [2019-11-22 14:25:30,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:30,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 14:25:30,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363976883] [2019-11-22 14:25:30,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:25:30,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:30,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:25:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:25:30,828 INFO L87 Difference]: Start difference. First operand 221 states and 259 transitions. Second operand 10 states. [2019-11-22 14:25:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:34,075 INFO L93 Difference]: Finished difference Result 323 states and 379 transitions. [2019-11-22 14:25:34,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:25:34,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 14:25:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:34,079 INFO L225 Difference]: With dead ends: 323 [2019-11-22 14:25:34,079 INFO L226 Difference]: Without dead ends: 323 [2019-11-22 14:25:34,079 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-22 14:25:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-22 14:25:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2019-11-22 14:25:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-22 14:25:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2019-11-22 14:25:34,087 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 22 [2019-11-22 14:25:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:34,088 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2019-11-22 14:25:34,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:25:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2019-11-22 14:25:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 14:25:34,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:34,089 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-22 14:25:34,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:34,292 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-22 14:25:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-22 14:25:34,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:34,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [443620544] [2019-11-22 14:25:34,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:34,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-22 14:25:34,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:34,898 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_170|]} [2019-11-22 14:25:34,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:34,903 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-22 14:25:34,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:34,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:34,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:34,922 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-22 14:25:34,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:34,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:34,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:34,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-22 14:25:34,957 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-22 14:25:34,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:34,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:34,978 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-22 14:25:34,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:34,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:34,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:34,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-11-22 14:25:35,079 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_69|], 4=[|v_#memory_$Pointer$.base_70|]} [2019-11-22 14:25:35,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:35,098 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-22 14:25:35,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:35,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:35,299 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-22 14:25:35,300 INFO L343 Elim1Store]: treesize reduction 38, result has 66.4 percent of original size [2019-11-22 14:25:35,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 142 [2019-11-22 14:25:35,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:35,382 INFO L567 ElimStorePlain]: treesize reduction 89, result has 51.1 percent of original size [2019-11-22 14:25:35,383 INFO L496 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-22 14:25:35,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:154, output treesize:93 [2019-11-22 14:25:41,439 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 14:25:43,552 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-22 14:25:45,644 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-22 14:25:46,799 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-22 14:25:46,800 INFO L343 Elim1Store]: treesize reduction 18, result has 92.2 percent of original size [2019-11-22 14:25:46,801 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 287 [2019-11-22 14:25:46,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:46,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:25:47,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 27 xjuncts. [2019-11-22 14:26:52,138 WARN L192 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 496 DAG size of output: 63 [2019-11-22 14:26:52,140 INFO L567 ElimStorePlain]: treesize reduction 68542, result has 0.6 percent of original size [2019-11-22 14:26:52,686 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-22 14:26:52,687 INFO L343 Elim1Store]: treesize reduction 18, result has 94.0 percent of original size [2019-11-22 14:26:52,687 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 380 treesize of output 482 [2019-11-22 14:26:52,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:26:52,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:26:52,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:26:52,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:26:52,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:26:52,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:26:52,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:26:52,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-22 14:27:22,519 WARN L192 SmtUtils]: Spent 29.81 s on a formula simplification. DAG size of input: 117 DAG size of output: 65 [2019-11-22 14:27:22,520 INFO L567 ElimStorePlain]: treesize reduction 13133, result has 4.1 percent of original size [2019-11-22 14:27:22,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:22,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:22,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:22,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:22,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:22,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:180, output treesize:461 [2019-11-22 14:27:22,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:22,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:22,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:22,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:34,808 WARN L192 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 109 DAG size of output: 43 [2019-11-22 14:27:34,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:40,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:45,076 WARN L192 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-22 14:27:45,089 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 6=[|#memory_$Pointer$.offset|]} [2019-11-22 14:27:45,096 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 50 treesize of output 26 [2019-11-22 14:27:45,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:27:45,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:45,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:27:45,154 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-22 14:27:45,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2019-11-22 14:27:45,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:27:45,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:45,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:45,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:21 [2019-11-22 14:27:45,226 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-22 14:27:45,227 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:27:45,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:45,878 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:45,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:27:46,177 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 14:27:46,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:46,194 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:46,211 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:46,483 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-22 14:27:46,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:46,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-22 14:27:46,486 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:141 [2019-11-22 14:27:55,785 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-22 14:27:57,828 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3)) (.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| .cse1) (bvadd .cse0 v_prenex_9 (_ bv3 32)) v_DerPreprocessor_3)) (.cse4 (bvadd .cse0 v_prenex_9))) (or (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 .cse2) c_create_data_~data~0.base) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse4 v_DerPreprocessor_1)) c_create_data_~data~0.base) .cse3))) (not (= v_DerPreprocessor_3 (select .cse2 .cse4)))))))) (forall ((|create_data_#t~mem8.offset| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9)) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse8 (store (select |c_#memory_$Pointer$.offset| .cse7) (bvadd .cse5 |create_data_#t~mem8.offset| (_ bv3 32)) v_DerPreprocessor_4))) (or (let ((.cse6 (select (select (store |c_#memory_$Pointer$.offset| .cse7 .cse8) c_create_data_~data~0.base) .cse9))) (bvule (bvadd .cse5 .cse6 (_ bv4 32)) (bvadd .cse5 .cse6 (_ bv8 32)))) (not (= v_DerPreprocessor_4 (select .cse8 (bvadd .cse5 |create_data_#t~mem8.offset|)))))))))) is different from false [2019-11-22 14:28:11,505 WARN L192 SmtUtils]: Spent 2.77 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-22 14:28:11,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:28:11,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:28:11,718 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-22 14:28:11,727 INFO L168 Benchmark]: Toolchain (without parser) took 181426.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 955.0 MB in the beginning and 938.8 MB in the end (delta: 16.2 MB). Peak memory consumption was 307.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:28:11,727 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:28:11,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -107.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:28:11,728 INFO L168 Benchmark]: Boogie Preprocessor took 90.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-22 14:28:11,729 INFO L168 Benchmark]: RCFGBuilder took 1386.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 966.3 MB in the end (delta: 83.3 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. [2019-11-22 14:28:11,729 INFO L168 Benchmark]: TraceAbstraction took 179193.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 206.6 MB). Free memory was 959.1 MB in the beginning and 938.8 MB in the end (delta: 20.3 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. [2019-11-22 14:28:11,733 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 750.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -107.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1386.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 966.3 MB in the end (delta: 83.3 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 179193.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 206.6 MB). Free memory was 959.1 MB in the beginning and 938.8 MB in the end (delta: 20.3 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...