./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.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/optional_data_creation_test04-1.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 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 ............................................................................................................................ 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/optional_data_creation_test04-1.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 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 14:25:31,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:25:31,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:25:31,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:25:31,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:25:31,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:25:31,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:25:31,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:25:31,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:25:31,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:25:31,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:25:31,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:25:31,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:25:31,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:25:31,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:25:31,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:25:31,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:25:31,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:25:31,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:25:31,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:25:31,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:25:31,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:25:31,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:25:31,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:25:31,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:25:31,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:25:31,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:25:31,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:25:31,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:25:31,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:25:31,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:25:31,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:25:31,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:25:31,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:25:31,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:25:31,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:25:31,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:25:31,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:25:31,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:25:31,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:25:31,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:25:31,378 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:31,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:25:31,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:25:31,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:25:31,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:25:31,407 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:25:31,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:25:31,408 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:25:31,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:25:31,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:25:31,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:25:31,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:25:31,410 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:25:31,410 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:25:31,411 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:25:31,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:25:31,411 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:25:31,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:25:31,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:25:31,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:25:31,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:25:31,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:25:31,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:25:31,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:25:31,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:25:31,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:25:31,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:25:31,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:25:31,415 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 -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-22 14:25:31,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:25:31,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:25:31,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:25:31,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:25:31,755 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:25:31,755 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 14:25:31,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36f59b48a/95a50e4f05714c9ab2f2560de5f77504/FLAG3ab46b596 [2019-11-22 14:25:32,268 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:25:32,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 14:25:32,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36f59b48a/95a50e4f05714c9ab2f2560de5f77504/FLAG3ab46b596 [2019-11-22 14:25:32,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36f59b48a/95a50e4f05714c9ab2f2560de5f77504 [2019-11-22 14:25:32,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:25:32,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:25:32,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:25:32,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:25:32,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:25:32,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:32" (1/1) ... [2019-11-22 14:25:32,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f2d2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:32, skipping insertion in model container [2019-11-22 14:25:32,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:32" (1/1) ... [2019-11-22 14:25:32,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:25:32,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:25:32,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:25:33,004 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:33,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1a691c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:33, skipping insertion in model container [2019-11-22 14:25:33,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:25:33,005 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-22 14:25:33,008 INFO L168 Benchmark]: Toolchain (without parser) took 446.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -135.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:25:33,009 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:33,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -135.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:25:33,012 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 444.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -135.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 544]: 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:34,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:25:34,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:25:34,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:25:34,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:25:34,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:25:34,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:25:34,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:25:34,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:25:34,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:25:34,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:25:34,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:25:34,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:25:34,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:25:34,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:25:34,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:25:34,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:25:34,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:25:34,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:25:34,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:25:34,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:25:34,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:25:34,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:25:34,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:25:34,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:25:34,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:25:34,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:25:34,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:25:34,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:25:34,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:25:34,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:25:34,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:25:34,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:25:34,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:25:34,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:25:34,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:25:34,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:25:34,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:25:34,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:25:34,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:25:34,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:25:34,833 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:34,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:25:34,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:25:34,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:25:34,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:25:34,856 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:25:34,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:25:34,856 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:25:34,857 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:25:34,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:25:34,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:25:34,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:25:34,858 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:25:34,858 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:25:34,858 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:25:34,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:25:34,859 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:25:34,859 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 14:25:34,859 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 14:25:34,859 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:25:34,860 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:25:34,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:25:34,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:25:34,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:25:34,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:25:34,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:25:34,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:25:34,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:25:34,862 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 14:25:34,862 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 14:25:34,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 14:25:34,863 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 -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-22 14:25:35,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:25:35,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:25:35,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:25:35,227 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:25:35,227 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:25:35,229 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 14:25:35,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72dba6af6/2cbd63f491ef48459b32919261cde6af/FLAGbd85dc88d [2019-11-22 14:25:35,845 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:25:35,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 14:25:35,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72dba6af6/2cbd63f491ef48459b32919261cde6af/FLAGbd85dc88d [2019-11-22 14:25:36,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72dba6af6/2cbd63f491ef48459b32919261cde6af [2019-11-22 14:25:36,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:25:36,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:25:36,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:25:36,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:25:36,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:25:36,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:36" (1/1) ... [2019-11-22 14:25:36,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bd7a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:36, skipping insertion in model container [2019-11-22 14:25:36,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:36" (1/1) ... [2019-11-22 14:25:36,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:25:36,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:25:36,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:25:36,628 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-22 14:25:36,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:25:36,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:25:36,718 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:25:36,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:25:36,855 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:25:36,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:36 WrapperNode [2019-11-22 14:25:36,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:25:36,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:25:36,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:25:36,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:25:36,873 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:36" (1/1) ... [2019-11-22 14:25:36,874 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:36" (1/1) ... [2019-11-22 14:25:36,897 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:36" (1/1) ... [2019-11-22 14:25:36,897 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:36" (1/1) ... [2019-11-22 14:25:36,923 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:36" (1/1) ... [2019-11-22 14:25:36,929 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:36" (1/1) ... [2019-11-22 14:25:36,934 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:36" (1/1) ... [2019-11-22 14:25:36,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:25:36,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:25:36,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:25:36,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:25:36,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:36" (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:36,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:25:36,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:25:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 14:25:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 14:25:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 14:25:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-22 14:25:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-22 14:25:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-22 14:25:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:25:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 14:25:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 14:25:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 14:25:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 14:25:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 14:25:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 14:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 14:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 14:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 14:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 14:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 14:25:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 14:25:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 14:25:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 14:25:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 14:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 14:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 14:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 14:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 14:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 14:25:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 14:25:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 14:25:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 14:25:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 14:25:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 14:25:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 14:25:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 14:25:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 14:25:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 14:25:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 14:25:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 14:25:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 14:25:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 14:25:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 14:25:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 14:25:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 14:25:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 14:25:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 14:25:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 14:25:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 14:25:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 14:25:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 14:25:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 14:25:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 14:25:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 14:25:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 14:25:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 14:25:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 14:25:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 14:25:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 14:25:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 14:25:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 14:25:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 14:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 14:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 14:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 14:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 14:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 14:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 14:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 14:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 14:25:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 14:25:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 14:25:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 14:25:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 14:25:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 14:25:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 14:25:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 14:25:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 14:25:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 14:25:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 14:25:37,010 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 14:25:37,010 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 14:25:37,010 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 14:25:37,010 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 14:25:37,010 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 14:25:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 14:25:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 14:25:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 14:25:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 14:25:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 14:25:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 14:25:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 14:25:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 14:25:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 14:25:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 14:25:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 14:25:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 14:25:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 14:25:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 14:25:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 14:25:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 14:25:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 14:25:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 14:25:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 14:25:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 14:25:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 14:25:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 14:25:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 14:25:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 14:25:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 14:25:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 14:25:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 14:25:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 14:25:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 14:25:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-22 14:25:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:25:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 14:25:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 14:25:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 14:25:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-22 14:25:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:25:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-22 14:25:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:25:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 14:25:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 14:25:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:25:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:25:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 14:25:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 14:25:37,978 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:25:37,978 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 14:25:37,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:25:37 BoogieIcfgContainer [2019-11-22 14:25:37,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:25:37,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:25:37,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:25:37,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:25:37,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:25:36" (1/3) ... [2019-11-22 14:25:37,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1375c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:25:37, skipping insertion in model container [2019-11-22 14:25:37,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:36" (2/3) ... [2019-11-22 14:25:37,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1375c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:25:37, skipping insertion in model container [2019-11-22 14:25:37,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:25:37" (3/3) ... [2019-11-22 14:25:38,000 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-22 14:25:38,012 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:25:38,021 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-22 14:25:38,032 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-22 14:25:38,052 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:25:38,052 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:25:38,053 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:25:38,053 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:25:38,053 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:25:38,054 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:25:38,054 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:25:38,054 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:25:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-22 14:25:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-22 14:25:38,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:38,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:38,085 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash -13807983, now seen corresponding path program 1 times [2019-11-22 14:25:38,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:38,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2108535801] [2019-11-22 14:25:38,103 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:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:38,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-22 14:25:38,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:38,332 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:38,332 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:38,352 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:38,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2108535801] [2019-11-22 14:25:38,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:38,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 14:25:38,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407146173] [2019-11-22 14:25:38,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-22 14:25:38,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:38,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-22 14:25:38,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 14:25:38,380 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-22 14:25:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:38,403 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-22 14:25:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-22 14:25:38,405 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-22 14:25:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:38,415 INFO L225 Difference]: With dead ends: 110 [2019-11-22 14:25:38,416 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 14:25:38,417 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:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 14:25:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-22 14:25:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-22 14:25:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-22 14:25:38,465 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-22 14:25:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:38,466 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-22 14:25:38,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-22 14:25:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-22 14:25:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 14:25:38,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:38,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:38,669 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:38,669 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:38,670 INFO L82 PathProgramCache]: Analyzing trace with hash -427980567, now seen corresponding path program 1 times [2019-11-22 14:25:38,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:38,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1798820299] [2019-11-22 14:25:38,671 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:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:38,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 14:25:38,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:38,902 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:38,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:38,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:38,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:38,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:25:38,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:38,964 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:38,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:38,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:38,981 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:38,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-22 14:25:39,006 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:39,006 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:39,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:39,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1798820299] [2019-11-22 14:25:39,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:39,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 14:25:39,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103348045] [2019-11-22 14:25:39,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:25:39,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:25:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:25:39,099 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 8 states. [2019-11-22 14:25:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:40,186 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-22 14:25:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 14:25:40,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 14:25:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:40,194 INFO L225 Difference]: With dead ends: 119 [2019-11-22 14:25:40,194 INFO L226 Difference]: Without dead ends: 119 [2019-11-22 14:25:40,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:25:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-22 14:25:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2019-11-22 14:25:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-22 14:25:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-22 14:25:40,213 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 9 [2019-11-22 14:25:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:40,213 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-22 14:25:40,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:25:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-22 14:25:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 14:25:40,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:40,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:40,417 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:40,417 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash -427980566, now seen corresponding path program 1 times [2019-11-22 14:25:40,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:40,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1770659000] [2019-11-22 14:25:40,425 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:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:40,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:25:40,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:40,674 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:40,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:40,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:40,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:40,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 14:25:40,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:40,756 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:40,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:40,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:40,775 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:40,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:22 [2019-11-22 14:25:40,800 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:40,801 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:40,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:25:41,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1770659000] [2019-11-22 14:25:41,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:41,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 14:25:41,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023319211] [2019-11-22 14:25:41,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:25:41,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:41,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:25:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:25:41,063 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 8 states. [2019-11-22 14:25:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:42,252 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-22 14:25:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:25:42,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 14:25:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:42,255 INFO L225 Difference]: With dead ends: 115 [2019-11-22 14:25:42,255 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 14:25:42,255 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:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 14:25:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2019-11-22 14:25:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-22 14:25:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-11-22 14:25:42,267 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 9 [2019-11-22 14:25:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:42,267 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-11-22 14:25:42,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:25:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-11-22 14:25:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:25:42,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:42,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:42,469 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:42,470 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:42,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:42,470 INFO L82 PathProgramCache]: Analyzing trace with hash -382495554, now seen corresponding path program 1 times [2019-11-22 14:25:42,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:42,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1633598901] [2019-11-22 14:25:42,472 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:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:42,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 14:25:42,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:42,642 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:42,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:42,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:42,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:42,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 14:25:42,661 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:42,661 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:42,686 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:42,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1633598901] [2019-11-22 14:25:42,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:42,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-22 14:25:42,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544379102] [2019-11-22 14:25:42,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:42,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:42,689 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 4 states. [2019-11-22 14:25:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:42,946 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-11-22 14:25:42,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:25:42,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 14:25:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:42,948 INFO L225 Difference]: With dead ends: 109 [2019-11-22 14:25:42,948 INFO L226 Difference]: Without dead ends: 109 [2019-11-22 14:25:42,948 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:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-22 14:25:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-22 14:25:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-22 14:25:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-22 14:25:42,958 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 10 [2019-11-22 14:25:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:42,958 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-22 14:25:42,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-22 14:25:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:25:42,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:42,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:43,168 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:43,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -382495553, now seen corresponding path program 1 times [2019-11-22 14:25:43,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:43,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [558145595] [2019-11-22 14:25:43,170 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:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:43,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 14:25:43,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:43,364 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:43,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:43,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:43,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:43,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:25:43,384 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:43,385 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:25:43,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [558145595] [2019-11-22 14:25:43,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:43,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 14:25:43,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927395257] [2019-11-22 14:25:43,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:43,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:43,431 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 4 states. [2019-11-22 14:25:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:43,778 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-11-22 14:25:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:25:43,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 14:25:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:43,780 INFO L225 Difference]: With dead ends: 108 [2019-11-22 14:25:43,780 INFO L226 Difference]: Without dead ends: 108 [2019-11-22 14:25:43,780 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:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-22 14:25:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-22 14:25:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-22 14:25:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-11-22 14:25:43,789 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 10 [2019-11-22 14:25:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:43,789 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-11-22 14:25:43,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-11-22 14:25:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 14:25:43,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:43,790 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:43,993 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:43,994 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:43,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846002, now seen corresponding path program 1 times [2019-11-22 14:25:43,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:43,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [132153018] [2019-11-22 14:25:43,996 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:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:44,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 14:25:44,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:44,205 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:44,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:44,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:44,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:44,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 14:25:44,211 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:44,211 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:44,218 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:44,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [132153018] [2019-11-22 14:25:44,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:44,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 14:25:44,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988937374] [2019-11-22 14:25:44,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:25:44,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:44,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:25:44,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:25:44,220 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 3 states. [2019-11-22 14:25:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:44,383 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-22 14:25:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:25:44,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-22 14:25:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:44,385 INFO L225 Difference]: With dead ends: 106 [2019-11-22 14:25:44,385 INFO L226 Difference]: Without dead ends: 106 [2019-11-22 14:25:44,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:25:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-22 14:25:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-22 14:25:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-22 14:25:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-22 14:25:44,394 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 15 [2019-11-22 14:25:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:44,394 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-22 14:25:44,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:25:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-22 14:25:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 14:25:44,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:44,395 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:44,597 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:44,598 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846001, now seen corresponding path program 1 times [2019-11-22 14:25:44,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:44,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [145396562] [2019-11-22 14:25:44,601 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:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:44,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 14:25:44,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:44,825 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:44,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:44,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:44,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:44,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:25:44,849 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:44,849 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:44,909 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:44,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [145396562] [2019-11-22 14:25:44,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:44,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 14:25:44,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27891664] [2019-11-22 14:25:44,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:44,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:44,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:44,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:44,911 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 4 states. [2019-11-22 14:25:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:45,204 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 14:25:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 14:25:45,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-22 14:25:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:45,207 INFO L225 Difference]: With dead ends: 107 [2019-11-22 14:25:45,207 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 14:25:45,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 14:25:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2019-11-22 14:25:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 14:25:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-11-22 14:25:45,214 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 15 [2019-11-22 14:25:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:45,214 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-11-22 14:25:45,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-11-22 14:25:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 14:25:45,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:45,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:45,417 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:45,418 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:45,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461638, now seen corresponding path program 1 times [2019-11-22 14:25:45,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:45,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [147357710] [2019-11-22 14:25:45,420 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:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:45,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 14:25:45,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:45,616 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:45,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:45,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:45,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:45,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 14:25:45,637 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:45,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:45,693 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:45,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [147357710] [2019-11-22 14:25:45,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:45,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-22 14:25:45,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955979986] [2019-11-22 14:25:45,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:25:45,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:25:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:25:45,695 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 6 states. [2019-11-22 14:25:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:46,151 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-22 14:25:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:25:46,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-22 14:25:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:46,154 INFO L225 Difference]: With dead ends: 140 [2019-11-22 14:25:46,154 INFO L226 Difference]: Without dead ends: 140 [2019-11-22 14:25:46,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:25:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-22 14:25:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 101. [2019-11-22 14:25:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-22 14:25:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-11-22 14:25:46,161 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 16 [2019-11-22 14:25:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:46,161 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-11-22 14:25:46,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:25:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-11-22 14:25:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 14:25:46,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:46,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:46,364 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:46,365 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:46,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461639, now seen corresponding path program 1 times [2019-11-22 14:25:46,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:46,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [398434577] [2019-11-22 14:25:46,368 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:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:46,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 14:25:46,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:46,559 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:46,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:46,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:46,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:46,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:25:46,582 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:46,582 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:46,696 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:46,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [398434577] [2019-11-22 14:25:46,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:46,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 14:25:46,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921764116] [2019-11-22 14:25:46,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:25:46,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:46,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:25:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:25:46,698 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 6 states. [2019-11-22 14:25:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:47,446 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-11-22 14:25:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:25:47,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-22 14:25:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:47,451 INFO L225 Difference]: With dead ends: 110 [2019-11-22 14:25:47,451 INFO L226 Difference]: Without dead ends: 110 [2019-11-22 14:25:47,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:25:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-22 14:25:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-11-22 14:25:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-22 14:25:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-22 14:25:47,458 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 16 [2019-11-22 14:25:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:47,458 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-22 14:25:47,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:25:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-22 14:25:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 14:25:47,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:47,460 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:47,662 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:47,663 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash 278501480, now seen corresponding path program 1 times [2019-11-22 14:25:47,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:47,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1936504168] [2019-11-22 14:25:47,665 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:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:47,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 14:25:47,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:47,925 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:47,925 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:47,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:47,984 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:47,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1936504168] [2019-11-22 14:25:47,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:47,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 14:25:47,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228256899] [2019-11-22 14:25:47,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:25:47,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:25:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:25:47,986 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 5 states. [2019-11-22 14:25:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:48,492 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 14:25:48,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 14:25:48,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-22 14:25:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:48,494 INFO L225 Difference]: With dead ends: 107 [2019-11-22 14:25:48,494 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 14:25:48,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:25:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 14:25:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-11-22 14:25:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-22 14:25:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-11-22 14:25:48,499 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 18 [2019-11-22 14:25:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:48,500 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-11-22 14:25:48,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:25:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-11-22 14:25:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 14:25:48,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:48,501 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:48,703 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:48,704 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash 278501479, now seen corresponding path program 1 times [2019-11-22 14:25:48,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:48,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1926277628] [2019-11-22 14:25:48,706 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:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:48,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 14:25:48,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:48,910 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:48,910 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:48,953 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:48,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1926277628] [2019-11-22 14:25:48,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:48,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 14:25:48,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950211352] [2019-11-22 14:25:48,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:25:48,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:48,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:25:48,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:25:48,956 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 5 states. [2019-11-22 14:25:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:49,369 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-11-22 14:25:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:25:49,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-22 14:25:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:49,372 INFO L225 Difference]: With dead ends: 142 [2019-11-22 14:25:49,372 INFO L226 Difference]: Without dead ends: 142 [2019-11-22 14:25:49,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:25:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-22 14:25:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2019-11-22 14:25:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-22 14:25:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-22 14:25:49,377 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 18 [2019-11-22 14:25:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:49,378 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-22 14:25:49,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:25:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-22 14:25:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 14:25:49,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:49,379 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:49,586 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:49,587 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:49,587 INFO L82 PathProgramCache]: Analyzing trace with hash 271010156, now seen corresponding path program 1 times [2019-11-22 14:25:49,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:49,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [576073229] [2019-11-22 14:25:49,588 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:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:49,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-22 14:25:49,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:49,798 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:49,798 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:49,807 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:49,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [576073229] [2019-11-22 14:25:49,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:49,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 14:25:49,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869884476] [2019-11-22 14:25:49,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:25:49,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:49,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:25:49,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:25:49,809 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 4 states. [2019-11-22 14:25:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:49,859 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-11-22 14:25:49,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 14:25:49,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 14:25:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:49,861 INFO L225 Difference]: With dead ends: 113 [2019-11-22 14:25:49,861 INFO L226 Difference]: Without dead ends: 113 [2019-11-22 14:25:49,862 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:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-22 14:25:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-11-22 14:25:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-22 14:25:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2019-11-22 14:25:49,865 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 18 [2019-11-22 14:25:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:49,866 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2019-11-22 14:25:49,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:25:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2019-11-22 14:25:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:25:49,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:49,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:50,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:50,070 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -188618374, now seen corresponding path program 1 times [2019-11-22 14:25:50,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:50,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1638942179] [2019-11-22 14:25:50,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:50,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 14:25:50,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:50,433 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:50,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:50,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:50,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:50,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:25:50,470 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:50,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:50,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:50,506 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:50,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:50,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:50,521 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:50,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-22 14:25:50,589 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 23 treesize of output 11 [2019-11-22 14:25:50,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:50,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:50,611 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:50,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:50,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:50,624 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:50,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-22 14:25:50,652 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:50,653 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:51,008 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:51,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1638942179] [2019-11-22 14:25:51,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:51,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 14:25:51,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241055125] [2019-11-22 14:25:51,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:25:51,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:51,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:25:51,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:25:51,010 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 10 states. [2019-11-22 14:25:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:52,687 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-22 14:25:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:25:52,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 14:25:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:52,689 INFO L225 Difference]: With dead ends: 120 [2019-11-22 14:25:52,689 INFO L226 Difference]: Without dead ends: 120 [2019-11-22 14:25:52,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-22 14:25:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-22 14:25:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2019-11-22 14:25:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-22 14:25:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2019-11-22 14:25:52,694 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 19 [2019-11-22 14:25:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:52,695 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2019-11-22 14:25:52,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:25:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2019-11-22 14:25:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:25:52,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:52,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:25:52,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:52,899 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:52,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash -188618375, now seen corresponding path program 1 times [2019-11-22 14:25:52,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:52,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2095027967] [2019-11-22 14:25:52,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:53,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 14:25:53,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:53,102 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:53,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:53,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:53,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:53,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 14:25:53,118 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:53,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:53,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:53,127 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:53,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-22 14:25:53,138 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 23 treesize of output 11 [2019-11-22 14:25:53,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:53,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:53,141 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:53,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-22 14:25:53,155 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:53,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:53,170 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:53,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2095027967] [2019-11-22 14:25:53,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:53,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 14:25:53,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379744430] [2019-11-22 14:25:53,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:25:53,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:53,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:25:53,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:25:53,171 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 5 states. [2019-11-22 14:25:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:25:53,532 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-11-22 14:25:53,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:25:53,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 14:25:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:25:53,534 INFO L225 Difference]: With dead ends: 115 [2019-11-22 14:25:53,534 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 14:25:53,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 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:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 14:25:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-11-22 14:25:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-22 14:25:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-22 14:25:53,539 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 19 [2019-11-22 14:25:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:25:53,539 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-22 14:25:53,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:25:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-22 14:25:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 14:25:53,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:25:53,540 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] [2019-11-22 14:25:53,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:53,743 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:25:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:25:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash 818029954, now seen corresponding path program 1 times [2019-11-22 14:25:53,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:25:53,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2011566368] [2019-11-22 14:25:53,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:25:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:25:53,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:25:53,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:25:53,980 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:53,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:53,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:53,996 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:53,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:54,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:54,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:25:54,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-22 14:25:54,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:25:54,075 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:54,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:54,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:54,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:54,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:25:54,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:25:54,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:25:54,115 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:54,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-22 14:25:54,135 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:54,136 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:25:54,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:54,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:54,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:54,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:57,060 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-22 14:25:57,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:25:57,496 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:57,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2011566368] [2019-11-22 14:25:57,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:25:57,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 14:25:57,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298880006] [2019-11-22 14:25:57,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:25:57,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:25:57,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:25:57,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-22 14:25:57,498 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-22 14:26:08,124 WARN L192 SmtUtils]: Spent 6.40 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-22 14:26:16,501 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-22 14:26:26,567 WARN L192 SmtUtils]: Spent 3.16 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 14:26:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:26:59,421 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2019-11-22 14:26:59,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:26:59,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-22 14:26:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:26:59,433 INFO L225 Difference]: With dead ends: 130 [2019-11-22 14:26:59,434 INFO L226 Difference]: Without dead ends: 130 [2019-11-22 14:26:59,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=57, Invalid=151, Unknown=2, NotChecked=0, Total=210 [2019-11-22 14:26:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-22 14:26:59,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2019-11-22 14:26:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-22 14:26:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-22 14:26:59,440 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 20 [2019-11-22 14:26:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:26:59,440 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-22 14:26:59,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:26:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-22 14:26:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 14:26:59,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:26:59,442 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:26:59,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:26:59,643 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:26:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:26:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358802, now seen corresponding path program 1 times [2019-11-22 14:26:59,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:26:59,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [944434878] [2019-11-22 14:26:59,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:26:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:26:59,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 14:26:59,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:26:59,877 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:26:59,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:26:59,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:26:59,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:26:59,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-22 14:26:59,900 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:26:59,901 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:26:59,973 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:26:59,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-11-22 14:26:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:26:59,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:26:59,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:26:59,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:26:59,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-22 14:27:00,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2019-11-22 14:27:00,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:27:00,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:00,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:27:00,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-22 14:27:00,009 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:27:00,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [944434878] [2019-11-22 14:27:00,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:27:00,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 14:27:00,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018553247] [2019-11-22 14:27:00,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:27:00,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:27:00,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:27:00,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:27:00,012 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2019-11-22 14:27:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:27:00,276 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 14:27:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:27:00,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-22 14:27:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:27:00,277 INFO L225 Difference]: With dead ends: 107 [2019-11-22 14:27:00,278 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 14:27:00,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:27:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 14:27:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-22 14:27:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-22 14:27:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-22 14:27:00,282 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-11-22 14:27:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:27:00,283 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-22 14:27:00,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:27:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-22 14:27:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 14:27:00,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:27:00,284 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:27:00,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:27:00,486 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:27:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:27:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358803, now seen corresponding path program 1 times [2019-11-22 14:27:00,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:27:00,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [912220798] [2019-11-22 14:27:00,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:27:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:27:00,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 14:27:00,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:27:00,739 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:27:00,740 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:27:00,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:00,856 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 8 treesize of output 6 [2019-11-22 14:27:00,856 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:00,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:00,872 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:27:00,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-22 14:27:00,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:00,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-22 14:27:00,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:00,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:00,997 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:01,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:01,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:01,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:01,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:26 [2019-11-22 14:27:01,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:01,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:01,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:01,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:01,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:01,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:01,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:01,797 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:27:01,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [912220798] [2019-11-22 14:27:01,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:27:01,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 14:27:01,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196195283] [2019-11-22 14:27:01,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:27:01,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:27:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:27:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:27:01,799 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 10 states. [2019-11-22 14:27:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:27:02,170 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-11-22 14:27:02,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:27:02,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 14:27:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:27:02,173 INFO L225 Difference]: With dead ends: 102 [2019-11-22 14:27:02,176 INFO L226 Difference]: Without dead ends: 102 [2019-11-22 14:27:02,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:27:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-22 14:27:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-22 14:27:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 14:27:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-11-22 14:27:02,182 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 22 [2019-11-22 14:27:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:27:02,183 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-11-22 14:27:02,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:27:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-11-22 14:27:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 14:27:02,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:27:02,184 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:27:02,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:27:02,386 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:27:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:27:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash 147774243, now seen corresponding path program 1 times [2019-11-22 14:27:02,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:27:02,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [458184807] [2019-11-22 14:27:02,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:27:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:27:02,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 14:27:02,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:27:02,635 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:27:02,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:27:02,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:02,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:27:02,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:27:02,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:27:02,699 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:27:02,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:27:02,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:02,719 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:27:02,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2019-11-22 14:27:02,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:27:02,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-11-22 14:27:02,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:27:02,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:02,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:02,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2019-11-22 14:27:02,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:27:02,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:27:03,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:27:03,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 43 [2019-11-22 14:27:03,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:27:03,102 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.1 percent of original size [2019-11-22 14:27:03,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:27:03,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:40 [2019-11-22 14:27:03,240 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:27:03,240 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:27:03,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:03,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:03,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:03,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:04,513 WARN L192 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-22 14:27:04,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:07,716 WARN L192 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-22 14:27:07,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:27:08,231 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:27:08,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [458184807] [2019-11-22 14:27:08,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:27:08,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-22 14:27:08,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663358870] [2019-11-22 14:27:08,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-22 14:27:08,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:27:08,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-22 14:27:08,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-22 14:27:08,232 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 16 states. [2019-11-22 14:27:49,624 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-22 14:29:06,009 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-11-22 14:30:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:59,562 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2019-11-22 14:30:59,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 14:30:59,564 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-22 14:30:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:59,565 INFO L225 Difference]: With dead ends: 196 [2019-11-22 14:30:59,566 INFO L226 Difference]: Without dead ends: 196 [2019-11-22 14:30:59,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-11-22 14:30:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-22 14:30:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 136. [2019-11-22 14:30:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-22 14:30:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2019-11-22 14:30:59,574 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 22 [2019-11-22 14:30:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:59,574 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2019-11-22 14:30:59,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-22 14:30:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2019-11-22 14:30:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 14:30:59,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:59,576 INFO L410 BasicCegarLoop]: trace histogram [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:30:59,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:30:59,777 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 14:30:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2027630961, now seen corresponding path program 1 times [2019-11-22 14:30:59,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:30:59,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [790943585] [2019-11-22 14:30:59,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:31:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:31:00,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 14:31:00,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:31:00,022 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:31:00,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 14:31:00,059 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 7 treesize of output 5 [2019-11-22 14:31:00,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,071 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:31:00,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2019-11-22 14:31:00,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:31:00,234 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:31:00,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,262 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:31:00,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2019-11-22 14:31:00,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:31:00,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:31:00,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 40 [2019-11-22 14:31:00,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,532 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-22 14:31:00,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:31:00,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:30 [2019-11-22 14:31:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:31:00,595 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:31:00,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:31:01,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:31:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:31:01,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:31:01,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:31:01,238 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 14:31:01,727 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-11-22 14:31:04,002 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-22 14:31:04,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:31:04,210 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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:31:04,217 INFO L168 Benchmark]: Toolchain (without parser) took 328091.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 957.7 MB in the beginning and 834.3 MB in the end (delta: 123.4 MB). Peak memory consumption was 444.8 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:04,221 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:31:04,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:04,222 INFO L168 Benchmark]: Boogie Preprocessor took 85.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:04,222 INFO L168 Benchmark]: RCFGBuilder took 1038.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:04,223 INFO L168 Benchmark]: TraceAbstraction took 326233.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.1 MB). Free memory was 1.0 GB in the beginning and 834.3 MB in the end (delta: 197.1 MB). Peak memory consumption was 383.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:04,225 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1038.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 326233.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.1 MB). Free memory was 1.0 GB in the beginning and 834.3 MB in the end (delta: 197.1 MB). Peak memory consumption was 383.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...