./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0c6505355e23ab050a0b1754726876dca60bcf4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0c6505355e23ab050a0b1754726876dca60bcf4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 03:30:41,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 03:30:41,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 03:30:41,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 03:30:41,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 03:30:41,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 03:30:41,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 03:30:41,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 03:30:41,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 03:30:41,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 03:30:41,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 03:30:41,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 03:30:41,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 03:30:41,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 03:30:41,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 03:30:41,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 03:30:41,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 03:30:41,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 03:30:41,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 03:30:41,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 03:30:41,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 03:30:41,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 03:30:41,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 03:30:41,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 03:30:41,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 03:30:41,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 03:30:41,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 03:30:41,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 03:30:41,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 03:30:41,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 03:30:41,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 03:30:41,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 03:30:41,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 03:30:41,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 03:30:41,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 03:30:41,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 03:30:41,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 03:30:41,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 03:30:41,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 03:30:41,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 03:30:41,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 03:30:41,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-10-26 03:30:41,180 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 03:30:41,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 03:30:41,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 03:30:41,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 03:30:41,187 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 03:30:41,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 03:30:41,188 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 03:30:41,188 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 03:30:41,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 03:30:41,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 03:30:41,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 03:30:41,191 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-26 03:30:41,191 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-26 03:30:41,191 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-26 03:30:41,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 03:30:41,192 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-26 03:30:41,192 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 03:30:41,192 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 03:30:41,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 03:30:41,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 03:30:41,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 03:30:41,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 03:30:41,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 03:30:41,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 03:30:41,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 03:30:41,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 03:30:41,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 03:30:41,195 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 03:30:41,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e0c6505355e23ab050a0b1754726876dca60bcf4 [2020-10-26 03:30:41,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 03:30:41,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 03:30:41,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 03:30:41,728 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 03:30:41,729 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 03:30:41,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2020-10-26 03:30:41,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31141774a/1df17858893c413a9f598630515356fd/FLAG754efa188 [2020-10-26 03:30:42,626 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 03:30:42,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2020-10-26 03:30:42,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31141774a/1df17858893c413a9f598630515356fd/FLAG754efa188 [2020-10-26 03:30:42,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31141774a/1df17858893c413a9f598630515356fd [2020-10-26 03:30:42,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 03:30:42,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-26 03:30:42,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 03:30:42,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 03:30:42,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 03:30:42,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:30:42" (1/1) ... [2020-10-26 03:30:42,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358bfeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:42, skipping insertion in model container [2020-10-26 03:30:42,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:30:42" (1/1) ... [2020-10-26 03:30:42,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 03:30:43,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 03:30:43,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:30:43,436 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 03:30:43,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:30:43,588 INFO L208 MainTranslator]: Completed translation [2020-10-26 03:30:43,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43 WrapperNode [2020-10-26 03:30:43,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 03:30:43,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 03:30:43,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 03:30:43,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 03:30:43,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (1/1) ... [2020-10-26 03:30:43,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (1/1) ... [2020-10-26 03:30:43,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (1/1) ... [2020-10-26 03:30:43,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (1/1) ... [2020-10-26 03:30:43,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (1/1) ... [2020-10-26 03:30:43,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (1/1) ... [2020-10-26 03:30:43,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (1/1) ... [2020-10-26 03:30:43,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 03:30:43,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 03:30:43,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 03:30:43,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 03:30:43,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (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 [2020-10-26 03:30:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 03:30:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 03:30:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 03:30:43,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-26 03:30:43,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-26 03:30:43,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-26 03:30:43,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-26 03:30:43,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-26 03:30:43,750 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2020-10-26 03:30:43,750 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2020-10-26 03:30:43,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 03:30:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 03:30:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 03:30:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-26 03:30:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-26 03:30:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 03:30:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 03:30:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-26 03:30:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-26 03:30:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-26 03:30:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-26 03:30:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-26 03:30:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-26 03:30:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-26 03:30:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-26 03:30:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-26 03:30:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-26 03:30:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-26 03:30:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-26 03:30:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-26 03:30:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-26 03:30:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-26 03:30:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-26 03:30:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-26 03:30:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-26 03:30:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-26 03:30:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-26 03:30:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-26 03:30:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-26 03:30:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-26 03:30:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-26 03:30:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-26 03:30:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-26 03:30:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-26 03:30:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-26 03:30:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-26 03:30:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-26 03:30:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-26 03:30:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-26 03:30:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-26 03:30:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-26 03:30:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-26 03:30:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-26 03:30:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-26 03:30:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-26 03:30:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-26 03:30:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-26 03:30:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-26 03:30:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-26 03:30:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-26 03:30:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-26 03:30:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-26 03:30:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-26 03:30:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-26 03:30:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-26 03:30:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-26 03:30:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-26 03:30:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-26 03:30:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-26 03:30:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-26 03:30:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-26 03:30:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-26 03:30:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-26 03:30:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-26 03:30:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-26 03:30:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-26 03:30:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-26 03:30:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-26 03:30:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-26 03:30:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-26 03:30:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-26 03:30:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-26 03:30:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-26 03:30:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 03:30:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-26 03:30:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-26 03:30:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-26 03:30:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-26 03:30:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-26 03:30:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-26 03:30:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-26 03:30:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-26 03:30:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-26 03:30:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-26 03:30:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-26 03:30:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-26 03:30:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-26 03:30:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-26 03:30:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-26 03:30:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-26 03:30:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-26 03:30:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-26 03:30:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-26 03:30:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-26 03:30:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-26 03:30:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-26 03:30:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-26 03:30:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-26 03:30:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-26 03:30:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-26 03:30:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-26 03:30:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-26 03:30:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-26 03:30:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-26 03:30:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-26 03:30:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-26 03:30:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-26 03:30:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-26 03:30:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-26 03:30:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-26 03:30:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-26 03:30:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-26 03:30:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-26 03:30:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2020-10-26 03:30:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-26 03:30:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-26 03:30:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2020-10-26 03:30:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-26 03:30:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 03:30:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 03:30:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 03:30:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 03:30:43,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 03:30:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 03:30:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 03:30:44,616 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 03:30:44,617 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-26 03:30:44,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:30:44 BoogieIcfgContainer [2020-10-26 03:30:44,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 03:30:44,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 03:30:44,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 03:30:44,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 03:30:44,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:30:42" (1/3) ... [2020-10-26 03:30:44,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d23ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:30:44, skipping insertion in model container [2020-10-26 03:30:44,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:43" (2/3) ... [2020-10-26 03:30:44,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d23ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:30:44, skipping insertion in model container [2020-10-26 03:30:44,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:30:44" (3/3) ... [2020-10-26 03:30:44,629 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2020-10-26 03:30:44,642 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 03:30:44,647 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-10-26 03:30:44,661 INFO L253 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-10-26 03:30:44,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 03:30:44,688 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-26 03:30:44,688 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 03:30:44,688 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 03:30:44,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 03:30:44,688 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 03:30:44,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 03:30:44,689 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 03:30:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2020-10-26 03:30:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 03:30:44,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:44,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:44,722 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2062563848, now seen corresponding path program 1 times [2020-10-26 03:30:44,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:44,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155667580] [2020-10-26 03:30:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:45,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:45,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155667580] [2020-10-26 03:30:45,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:45,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 03:30:45,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412672846] [2020-10-26 03:30:45,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 03:30:45,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 03:30:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 03:30:45,207 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 6 states. [2020-10-26 03:30:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:45,699 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2020-10-26 03:30:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 03:30:45,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-26 03:30:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:45,715 INFO L225 Difference]: With dead ends: 61 [2020-10-26 03:30:45,715 INFO L226 Difference]: Without dead ends: 58 [2020-10-26 03:30:45,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 03:30:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-26 03:30:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2020-10-26 03:30:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-26 03:30:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2020-10-26 03:30:45,768 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2020-10-26 03:30:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:45,769 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2020-10-26 03:30:45,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 03:30:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-10-26 03:30:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 03:30:45,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:45,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:45,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 03:30:45,771 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2062563849, now seen corresponding path program 1 times [2020-10-26 03:30:45,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:45,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146061222] [2020-10-26 03:30:45,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:45,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:45,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146061222] [2020-10-26 03:30:45,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:45,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 03:30:45,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304038677] [2020-10-26 03:30:46,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 03:30:46,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:46,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 03:30:46,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 03:30:46,009 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 6 states. [2020-10-26 03:30:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:46,476 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2020-10-26 03:30:46,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 03:30:46,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-26 03:30:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:46,478 INFO L225 Difference]: With dead ends: 57 [2020-10-26 03:30:46,479 INFO L226 Difference]: Without dead ends: 57 [2020-10-26 03:30:46,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 03:30:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-26 03:30:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2020-10-26 03:30:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-26 03:30:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-10-26 03:30:46,488 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2020-10-26 03:30:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:46,488 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-10-26 03:30:46,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 03:30:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-10-26 03:30:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 03:30:46,489 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:46,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:46,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 03:30:46,490 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2143934378, now seen corresponding path program 1 times [2020-10-26 03:30:46,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:46,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403252314] [2020-10-26 03:30:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:46,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:46,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403252314] [2020-10-26 03:30:46,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:46,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 03:30:46,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915139118] [2020-10-26 03:30:46,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 03:30:46,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:46,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 03:30:46,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-26 03:30:46,735 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 7 states. [2020-10-26 03:30:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:47,096 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-10-26 03:30:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 03:30:47,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-26 03:30:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:47,099 INFO L225 Difference]: With dead ends: 56 [2020-10-26 03:30:47,099 INFO L226 Difference]: Without dead ends: 56 [2020-10-26 03:30:47,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:30:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-26 03:30:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2020-10-26 03:30:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-26 03:30:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-10-26 03:30:47,107 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2020-10-26 03:30:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:47,107 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-10-26 03:30:47,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 03:30:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-10-26 03:30:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 03:30:47,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:47,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:47,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 03:30:47,109 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:47,110 INFO L82 PathProgramCache]: Analyzing trace with hash -129348870, now seen corresponding path program 1 times [2020-10-26 03:30:47,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:47,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245040081] [2020-10-26 03:30:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:47,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:47,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:47,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245040081] [2020-10-26 03:30:47,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:47,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-26 03:30:47,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742954893] [2020-10-26 03:30:47,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-26 03:30:47,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 03:30:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:30:47,461 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 9 states. [2020-10-26 03:30:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:48,007 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-10-26 03:30:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 03:30:48,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-26 03:30:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:48,009 INFO L225 Difference]: With dead ends: 51 [2020-10-26 03:30:48,009 INFO L226 Difference]: Without dead ends: 51 [2020-10-26 03:30:48,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-10-26 03:30:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-26 03:30:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-10-26 03:30:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-26 03:30:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-10-26 03:30:48,016 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2020-10-26 03:30:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:48,017 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-26 03:30:48,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-26 03:30:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-10-26 03:30:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 03:30:48,018 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:48,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:48,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 03:30:48,027 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:48,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:48,028 INFO L82 PathProgramCache]: Analyzing trace with hash -129348869, now seen corresponding path program 1 times [2020-10-26 03:30:48,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:48,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241601050] [2020-10-26 03:30:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:48,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:48,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:48,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241601050] [2020-10-26 03:30:48,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:48,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 03:30:48,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143761439] [2020-10-26 03:30:48,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 03:30:48,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:48,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 03:30:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-26 03:30:48,296 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 11 states. [2020-10-26 03:30:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:48,923 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-10-26 03:30:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 03:30:48,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-10-26 03:30:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:48,928 INFO L225 Difference]: With dead ends: 44 [2020-10-26 03:30:48,928 INFO L226 Difference]: Without dead ends: 44 [2020-10-26 03:30:48,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-10-26 03:30:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-26 03:30:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-10-26 03:30:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-26 03:30:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-10-26 03:30:48,935 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2020-10-26 03:30:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:48,935 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-10-26 03:30:48,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 03:30:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-10-26 03:30:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-26 03:30:48,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:48,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:48,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 03:30:48,937 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1752734705, now seen corresponding path program 1 times [2020-10-26 03:30:48,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:48,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431781582] [2020-10-26 03:30:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:49,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:49,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:49,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431781582] [2020-10-26 03:30:49,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:49,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-26 03:30:49,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192826333] [2020-10-26 03:30:49,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 03:30:49,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:49,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 03:30:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-26 03:30:49,204 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2020-10-26 03:30:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:49,878 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-10-26 03:30:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 03:30:49,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-26 03:30:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:49,881 INFO L225 Difference]: With dead ends: 43 [2020-10-26 03:30:49,881 INFO L226 Difference]: Without dead ends: 43 [2020-10-26 03:30:49,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-10-26 03:30:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-26 03:30:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-10-26 03:30:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-26 03:30:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2020-10-26 03:30:49,887 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 21 [2020-10-26 03:30:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:49,888 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2020-10-26 03:30:49,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 03:30:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2020-10-26 03:30:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 03:30:49,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:49,889 INFO L422 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] [2020-10-26 03:30:49,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 03:30:49,890 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:49,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1499799070, now seen corresponding path program 1 times [2020-10-26 03:30:49,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:49,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589742356] [2020-10-26 03:30:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:50,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:50,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:50,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589742356] [2020-10-26 03:30:50,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:50,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-26 03:30:50,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974529741] [2020-10-26 03:30:50,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 03:30:50,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 03:30:50,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-26 03:30:50,171 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 12 states. [2020-10-26 03:30:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:50,845 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-10-26 03:30:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 03:30:50,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 03:30:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:50,848 INFO L225 Difference]: With dead ends: 42 [2020-10-26 03:30:50,848 INFO L226 Difference]: Without dead ends: 42 [2020-10-26 03:30:50,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2020-10-26 03:30:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-26 03:30:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2020-10-26 03:30:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-26 03:30:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2020-10-26 03:30:50,862 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 22 [2020-10-26 03:30:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:50,862 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2020-10-26 03:30:50,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 03:30:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-10-26 03:30:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:30:50,863 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:50,863 INFO L422 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, 1] [2020-10-26 03:30:50,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 03:30:50,865 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash -750869007, now seen corresponding path program 1 times [2020-10-26 03:30:50,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:50,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757068954] [2020-10-26 03:30:50,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:50,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:51,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:51,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757068954] [2020-10-26 03:30:51,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:51,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-26 03:30:51,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761586259] [2020-10-26 03:30:51,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 03:30:51,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:51,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 03:30:51,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-26 03:30:51,142 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2020-10-26 03:30:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:51,760 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-10-26 03:30:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 03:30:51,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-26 03:30:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:51,761 INFO L225 Difference]: With dead ends: 41 [2020-10-26 03:30:51,762 INFO L226 Difference]: Without dead ends: 41 [2020-10-26 03:30:51,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2020-10-26 03:30:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-26 03:30:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-10-26 03:30:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-26 03:30:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-10-26 03:30:51,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 23 [2020-10-26 03:30:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:51,775 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-10-26 03:30:51,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 03:30:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-10-26 03:30:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 03:30:51,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:51,779 INFO L422 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, 1, 1] [2020-10-26 03:30:51,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 03:30:51,780 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:51,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1802102656, now seen corresponding path program 1 times [2020-10-26 03:30:51,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:51,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613596019] [2020-10-26 03:30:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:51,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:51,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:51,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613596019] [2020-10-26 03:30:51,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:51,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 03:30:51,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585324437] [2020-10-26 03:30:51,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 03:30:51,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:51,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 03:30:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 03:30:51,926 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 6 states. [2020-10-26 03:30:52,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:52,151 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2020-10-26 03:30:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 03:30:52,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-26 03:30:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:52,154 INFO L225 Difference]: With dead ends: 40 [2020-10-26 03:30:52,154 INFO L226 Difference]: Without dead ends: 40 [2020-10-26 03:30:52,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-26 03:30:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-26 03:30:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-10-26 03:30:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-26 03:30:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-10-26 03:30:52,158 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 24 [2020-10-26 03:30:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:52,159 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-10-26 03:30:52,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 03:30:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-10-26 03:30:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 03:30:52,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:52,160 INFO L422 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, 1, 1, 1] [2020-10-26 03:30:52,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 03:30:52,160 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:52,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:52,161 INFO L82 PathProgramCache]: Analyzing trace with hash -30607405, now seen corresponding path program 1 times [2020-10-26 03:30:52,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:52,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776929541] [2020-10-26 03:30:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:52,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:30:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:52,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-26 03:30:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:52,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776929541] [2020-10-26 03:30:52,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:30:52,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 03:30:52,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516480800] [2020-10-26 03:30:52,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 03:30:52,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:30:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 03:30:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 03:30:52,256 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 6 states. [2020-10-26 03:30:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:30:52,495 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-10-26 03:30:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 03:30:52,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-26 03:30:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:30:52,496 INFO L225 Difference]: With dead ends: 39 [2020-10-26 03:30:52,496 INFO L226 Difference]: Without dead ends: 39 [2020-10-26 03:30:52,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-26 03:30:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-26 03:30:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-26 03:30:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-26 03:30:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-10-26 03:30:52,501 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 25 [2020-10-26 03:30:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:30:52,501 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-10-26 03:30:52,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 03:30:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-10-26 03:30:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:30:52,502 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:52,502 INFO L422 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, 1, 1, 1, 1] [2020-10-26 03:30:52,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 03:30:52,503 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:52,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash -993519269, now seen corresponding path program 1 times [2020-10-26 03:30:52,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:30:52,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288304476] [2020-10-26 03:30:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:30:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 03:30:52,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 03:30:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 03:30:52,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 03:30:52,640 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 03:30:52,640 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 03:30:52,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 03:30:52,680 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-10-26 03:30:52,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 03:30:52 BoogieIcfgContainer [2020-10-26 03:30:52,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 03:30:52,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 03:30:52,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 03:30:52,718 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 03:30:52,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:30:44" (3/4) ... [2020-10-26 03:30:52,723 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 03:30:52,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 03:30:52,727 INFO L168 Benchmark]: Toolchain (without parser) took 9784.46 ms. Allocated memory was 41.9 MB in the beginning and 130.0 MB in the end (delta: 88.1 MB). Free memory was 26.6 MB in the beginning and 81.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:52,727 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 41.9 MB. Free memory was 24.3 MB in the beginning and 24.3 MB in the end (delta: 23.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:30:52,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.81 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 25.9 MB in the beginning and 22.4 MB in the end (delta: 3.6 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:52,731 INFO L168 Benchmark]: Boogie Preprocessor took 70.76 ms. Allocated memory is still 50.3 MB. Free memory was 22.4 MB in the beginning and 32.1 MB in the end (delta: -9.7 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:52,733 INFO L168 Benchmark]: RCFGBuilder took 957.43 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 32.1 MB in the beginning and 37.2 MB in the end (delta: -5.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:52,735 INFO L168 Benchmark]: TraceAbstraction took 8096.16 ms. Allocated memory was 60.8 MB in the beginning and 130.0 MB in the end (delta: 69.2 MB). Free memory was 36.9 MB in the beginning and 83.0 MB in the end (delta: -46.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 16.1 GB. [2020-10-26 03:30:52,736 INFO L168 Benchmark]: Witness Printer took 5.48 ms. Allocated memory is still 130.0 MB. Free memory is still 81.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:30:52,745 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63 ms. Allocated memory is still 41.9 MB. Free memory was 24.3 MB in the beginning and 24.3 MB in the end (delta: 23.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 638.81 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 25.9 MB in the beginning and 22.4 MB in the end (delta: 3.6 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.76 ms. Allocated memory is still 50.3 MB. Free memory was 22.4 MB in the beginning and 32.1 MB in the end (delta: -9.7 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 957.43 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 32.1 MB in the beginning and 37.2 MB in the end (delta: -5.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8096.16 ms. Allocated memory was 60.8 MB in the beginning and 130.0 MB in the end (delta: 69.2 MB). Free memory was 36.9 MB in the beginning and 83.0 MB in the end (delta: -46.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 16.1 GB. * Witness Printer took 5.48 ms. Allocated memory is still 130.0 MB. Free memory is still 81.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; VAL [data={3:0}] [L545] CALL alloc_data(&data) VAL [pdata={3:0}] [L529] pdata->lo = malloc(16) VAL [malloc(16)={-1:0}, pdata={3:0}, pdata={3:0}] [L530] pdata->hi = malloc(24) VAL [malloc(16)={-1:0}, malloc(24)={-2:0}, pdata={3:0}, pdata={3:0}] [L545] RET alloc_data(&data) VAL [data={3:0}] [L546] CALL free_data(&data) VAL [data={3:0}] [L534] EXPR data->lo VAL [data={3:0}, data={3:0}, data->lo={-1:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={3:0}, data={3:0}, data->hi={-2:0}, lo={-1:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L540] data->lo = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L541] data->hi = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L546] RET free_data(&data) VAL [data={3:0}] [L547] return 0; [L547] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 74 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 233 SDtfs, 505 SDslu, 541 SDs, 0 SdLazy, 1660 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 51 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 17891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-5485861 [2020-10-26 03:30:55,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 03:30:55,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 03:30:55,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 03:30:55,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 03:30:55,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 03:30:55,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 03:30:55,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 03:30:55,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 03:30:55,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 03:30:55,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 03:30:55,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 03:30:55,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 03:30:55,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 03:30:55,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 03:30:55,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 03:30:55,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 03:30:55,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 03:30:55,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 03:30:55,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 03:30:55,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 03:30:55,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 03:30:55,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 03:30:55,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 03:30:55,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 03:30:55,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 03:30:55,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 03:30:55,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 03:30:55,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 03:30:55,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 03:30:55,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 03:30:55,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 03:30:55,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 03:30:55,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 03:30:55,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 03:30:55,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 03:30:55,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 03:30:55,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 03:30:55,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 03:30:55,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 03:30:55,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 03:30:55,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-10-26 03:30:55,738 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 03:30:55,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 03:30:55,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 03:30:55,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 03:30:55,741 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 03:30:55,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 03:30:55,743 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 03:30:55,743 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 03:30:55,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 03:30:55,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 03:30:55,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 03:30:55,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-26 03:30:55,745 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-26 03:30:55,746 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-26 03:30:55,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 03:30:55,746 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-26 03:30:55,746 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-26 03:30:55,747 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-26 03:30:55,747 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 03:30:55,747 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 03:30:55,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 03:30:55,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 03:30:55,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 03:30:55,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 03:30:55,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 03:30:55,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 03:30:55,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 03:30:55,749 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-26 03:30:55,750 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-26 03:30:55,750 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 03:30:55,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-26 03:30:55,750 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e0c6505355e23ab050a0b1754726876dca60bcf4 [2020-10-26 03:30:56,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 03:30:56,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 03:30:56,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 03:30:56,238 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 03:30:56,238 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 03:30:56,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2020-10-26 03:30:56,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5e8ccca/62222927bec34449aaba4b8176f80cba/FLAG37b9165c9 [2020-10-26 03:30:56,984 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 03:30:56,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2020-10-26 03:30:57,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5e8ccca/62222927bec34449aaba4b8176f80cba/FLAG37b9165c9 [2020-10-26 03:30:57,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5e8ccca/62222927bec34449aaba4b8176f80cba [2020-10-26 03:30:57,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 03:30:57,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-26 03:30:57,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 03:30:57,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 03:30:57,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 03:30:57,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6ccdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57, skipping insertion in model container [2020-10-26 03:30:57,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 03:30:57,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 03:30:57,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:30:57,757 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 03:30:57,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:30:57,888 INFO L208 MainTranslator]: Completed translation [2020-10-26 03:30:57,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57 WrapperNode [2020-10-26 03:30:57,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 03:30:57,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 03:30:57,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 03:30:57,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 03:30:57,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (1/1) ... [2020-10-26 03:30:57,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 03:30:57,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 03:30:57,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 03:30:57,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 03:30:57,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (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 [2020-10-26 03:30:58,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 03:30:58,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 03:30:58,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-10-26 03:30:58,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 03:30:58,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-26 03:30:58,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-26 03:30:58,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-26 03:30:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-26 03:30:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-26 03:30:58,059 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2020-10-26 03:30:58,059 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2020-10-26 03:30:58,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 03:30:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 03:30:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 03:30:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-26 03:30:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-26 03:30:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 03:30:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 03:30:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-26 03:30:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-26 03:30:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-26 03:30:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-26 03:30:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-26 03:30:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-26 03:30:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-26 03:30:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-26 03:30:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-26 03:30:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-26 03:30:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-26 03:30:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-26 03:30:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-26 03:30:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-26 03:30:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-26 03:30:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-26 03:30:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-26 03:30:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-26 03:30:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-26 03:30:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-26 03:30:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-26 03:30:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-26 03:30:58,066 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-26 03:30:58,066 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-26 03:30:58,066 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-26 03:30:58,066 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-26 03:30:58,066 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-26 03:30:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-26 03:30:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-26 03:30:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-26 03:30:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-26 03:30:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-26 03:30:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-26 03:30:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-26 03:30:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-26 03:30:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-26 03:30:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-26 03:30:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-26 03:30:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-26 03:30:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-26 03:30:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-26 03:30:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-26 03:30:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-26 03:30:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-26 03:30:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-26 03:30:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-26 03:30:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-26 03:30:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-26 03:30:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-26 03:30:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-26 03:30:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-26 03:30:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-26 03:30:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-26 03:30:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-26 03:30:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-26 03:30:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-26 03:30:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-26 03:30:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-26 03:30:58,077 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-26 03:30:58,077 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-26 03:30:58,077 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-26 03:30:58,077 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-26 03:30:58,077 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-26 03:30:58,078 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-26 03:30:58,078 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-26 03:30:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-26 03:30:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 03:30:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-26 03:30:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-26 03:30:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-26 03:30:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-26 03:30:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-26 03:30:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-26 03:30:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-26 03:30:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-26 03:30:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-26 03:30:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-26 03:30:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-26 03:30:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-26 03:30:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-26 03:30:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-26 03:30:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-26 03:30:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-26 03:30:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-26 03:30:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-26 03:30:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-26 03:30:58,083 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-26 03:30:58,083 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-26 03:30:58,083 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-26 03:30:58,083 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-26 03:30:58,083 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-26 03:30:58,083 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-26 03:30:58,083 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-26 03:30:58,083 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-26 03:30:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-26 03:30:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-26 03:30:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-26 03:30:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-26 03:30:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2020-10-26 03:30:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-26 03:30:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-26 03:30:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2020-10-26 03:30:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-26 03:30:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 03:30:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 03:30:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 03:30:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-26 03:30:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 03:30:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-10-26 03:30:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-10-26 03:30:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-10-26 03:30:58,785 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 03:30:58,785 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-26 03:30:58,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:30:58 BoogieIcfgContainer [2020-10-26 03:30:58,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 03:30:58,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 03:30:58,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 03:30:58,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 03:30:58,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:30:57" (1/3) ... [2020-10-26 03:30:58,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472a9f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:30:58, skipping insertion in model container [2020-10-26 03:30:58,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:30:57" (2/3) ... [2020-10-26 03:30:58,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472a9f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:30:58, skipping insertion in model container [2020-10-26 03:30:58,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:30:58" (3/3) ... [2020-10-26 03:30:58,797 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2020-10-26 03:30:58,810 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 03:30:58,816 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-10-26 03:30:58,832 INFO L253 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-10-26 03:30:58,858 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 03:30:58,858 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-26 03:30:58,858 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 03:30:58,858 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 03:30:58,858 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 03:30:58,858 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 03:30:58,859 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 03:30:58,859 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 03:30:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2020-10-26 03:30:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 03:30:58,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:30:58,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:30:58,889 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:30:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:30:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash -658526433, now seen corresponding path program 1 times [2020-10-26 03:30:58,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:30:58,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607722728] [2020-10-26 03:30:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-26 03:30:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:30:59,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-26 03:30:59,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:30:59,194 INFO L384 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 [2020-10-26 03:30:59,194 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:30:59,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:30:59,218 INFO L384 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 [2020-10-26 03:30:59,218 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 03:30:59,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:30:59,228 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:30:59,228 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-10-26 03:30:59,315 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:30:59,315 INFO L384 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 [2020-10-26 03:30:59,317 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:30:59,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:30:59,338 INFO L384 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 [2020-10-26 03:30:59,339 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 03:30:59,361 INFO L625 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2020-10-26 03:30:59,363 INFO L545 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. [2020-10-26 03:30:59,363 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-10-26 03:30:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:30:59,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:30:59,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:01,405 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 21 [2020-10-26 03:31:02,187 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-26 03:31:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:02,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607722728] [2020-10-26 03:31:02,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:02,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-26 03:31:02,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226108735] [2020-10-26 03:31:02,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 03:31:02,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 03:31:02,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-26 03:31:02,236 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 8 states. [2020-10-26 03:31:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:03,297 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-10-26 03:31:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 03:31:03,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-10-26 03:31:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:03,309 INFO L225 Difference]: With dead ends: 53 [2020-10-26 03:31:03,309 INFO L226 Difference]: Without dead ends: 50 [2020-10-26 03:31:03,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-26 03:31:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-26 03:31:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-10-26 03:31:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-26 03:31:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2020-10-26 03:31:03,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 9 [2020-10-26 03:31:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:03,353 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2020-10-26 03:31:03,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 03:31:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2020-10-26 03:31:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 03:31:03,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:03,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:31:03,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-26 03:31:03,568 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:03,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:03,569 INFO L82 PathProgramCache]: Analyzing trace with hash -658526434, now seen corresponding path program 1 times [2020-10-26 03:31:03,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:03,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535206311] [2020-10-26 03:31:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:31:03,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 03:31:03,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:31:03,769 INFO L384 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 [2020-10-26 03:31:03,770 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:03,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:03,773 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:03,774 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-26 03:31:03,814 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:03,815 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-10-26 03:31:03,816 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:03,847 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-10-26 03:31:03,848 INFO L545 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. [2020-10-26 03:31:03,849 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-10-26 03:31:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:03,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:31:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:03,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535206311] [2020-10-26 03:31:03,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:03,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-26 03:31:03,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842932954] [2020-10-26 03:31:03,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 03:31:03,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 03:31:03,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 03:31:03,913 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 5 states. [2020-10-26 03:31:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:04,117 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-10-26 03:31:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 03:31:04,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-26 03:31:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:04,119 INFO L225 Difference]: With dead ends: 48 [2020-10-26 03:31:04,120 INFO L226 Difference]: Without dead ends: 48 [2020-10-26 03:31:04,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-26 03:31:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-26 03:31:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-26 03:31:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-26 03:31:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-10-26 03:31:04,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2020-10-26 03:31:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:04,128 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-10-26 03:31:04,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 03:31:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-10-26 03:31:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 03:31:04,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:04,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:31:04,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-26 03:31:04,342 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1483709952, now seen corresponding path program 1 times [2020-10-26 03:31:04,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:04,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925329841] [2020-10-26 03:31:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:31:04,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-26 03:31:04,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:31:04,545 INFO L384 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 [2020-10-26 03:31:04,546 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:04,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:04,562 INFO L384 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 [2020-10-26 03:31:04,563 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:04,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:04,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:04,573 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-10-26 03:31:04,671 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:04,671 INFO L384 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 [2020-10-26 03:31:04,674 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:04,694 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:04,703 INFO L384 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 [2020-10-26 03:31:04,704 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:04,732 INFO L625 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2020-10-26 03:31:04,734 INFO L545 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. [2020-10-26 03:31:04,734 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-10-26 03:31:04,857 INFO L441 ElimStorePlain]: Different costs {1=[|v_#valid_57|], 3=[|v_#length_42|]} [2020-10-26 03:31:04,884 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:04,884 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-10-26 03:31:04,886 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:04,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:04,959 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:04,959 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2020-10-26 03:31:04,963 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:05,015 INFO L625 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size [2020-10-26 03:31:05,019 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:05,019 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:16 [2020-10-26 03:31:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:05,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:31:05,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:08,679 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-26 03:31:08,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:08,840 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:08,841 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-10-26 03:31:08,842 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:08,864 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:08,864 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-10-26 03:31:08,866 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:08,906 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:08,916 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-10-26 03:31:08,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2020-10-26 03:31:09,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:09,797 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-26 03:31:10,585 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-10-26 03:31:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:10,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925329841] [2020-10-26 03:31:10,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:10,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2020-10-26 03:31:10,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171956722] [2020-10-26 03:31:10,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 03:31:10,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 03:31:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2020-10-26 03:31:10,618 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2020-10-26 03:31:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:11,399 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-10-26 03:31:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 03:31:11,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-10-26 03:31:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:11,401 INFO L225 Difference]: With dead ends: 47 [2020-10-26 03:31:11,401 INFO L226 Difference]: Without dead ends: 47 [2020-10-26 03:31:11,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=43, Invalid=112, Unknown=1, NotChecked=0, Total=156 [2020-10-26 03:31:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-26 03:31:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-26 03:31:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-26 03:31:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-10-26 03:31:11,408 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2020-10-26 03:31:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:11,408 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-10-26 03:31:11,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 03:31:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-10-26 03:31:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 03:31:11,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:11,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:31:11,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-26 03:31:11,613 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:11,614 INFO L82 PathProgramCache]: Analyzing trace with hash -854908678, now seen corresponding path program 1 times [2020-10-26 03:31:11,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:11,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877990845] [2020-10-26 03:31:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:31:11,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 03:31:11,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:31:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:11,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:31:11,899 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:11,900 INFO L384 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 [2020-10-26 03:31:11,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:11,906 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:11,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:11,909 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:11,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2020-10-26 03:31:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:11,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877990845] [2020-10-26 03:31:11,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:11,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-10-26 03:31:11,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448852637] [2020-10-26 03:31:11,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 03:31:11,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:11,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 03:31:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-26 03:31:11,922 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 7 states. [2020-10-26 03:31:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:12,330 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-10-26 03:31:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 03:31:12,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-26 03:31:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:12,336 INFO L225 Difference]: With dead ends: 51 [2020-10-26 03:31:12,336 INFO L226 Difference]: Without dead ends: 51 [2020-10-26 03:31:12,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:31:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-26 03:31:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-10-26 03:31:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-26 03:31:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-10-26 03:31:12,350 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2020-10-26 03:31:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:12,351 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-26 03:31:12,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 03:31:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-10-26 03:31:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 03:31:12,351 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:12,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:31:12,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-26 03:31:12,553 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash -854908677, now seen corresponding path program 1 times [2020-10-26 03:31:12,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:12,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446173934] [2020-10-26 03:31:12,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:31:12,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 03:31:12,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:31:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:12,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:31:13,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,100 INFO L384 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 16 treesize of output 12 [2020-10-26 03:31:13,102 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:13,118 INFO L384 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 [2020-10-26 03:31:13,119 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:13,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:13,154 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-10-26 03:31:13,154 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2020-10-26 03:31:13,531 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:13,531 INFO L384 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 [2020-10-26 03:31:13,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,538 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:13,568 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:13,568 INFO L384 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 [2020-10-26 03:31:13,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,574 INFO L545 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:13,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:13,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,678 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-26 03:31:13,678 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:64 [2020-10-26 03:31:13,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:13,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:14,305 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2020-10-26 03:31:14,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-26 03:31:14,915 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-10-26 03:31:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:15,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446173934] [2020-10-26 03:31:15,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:15,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2020-10-26 03:31:15,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267092259] [2020-10-26 03:31:15,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-26 03:31:15,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-26 03:31:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-10-26 03:31:15,405 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-10-26 03:31:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:16,416 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-10-26 03:31:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 03:31:16,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2020-10-26 03:31:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:16,420 INFO L225 Difference]: With dead ends: 41 [2020-10-26 03:31:16,420 INFO L226 Difference]: Without dead ends: 41 [2020-10-26 03:31:16,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-26 03:31:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-26 03:31:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-26 03:31:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-26 03:31:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-10-26 03:31:16,433 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2020-10-26 03:31:16,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:16,434 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-10-26 03:31:16,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-26 03:31:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-10-26 03:31:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-26 03:31:16,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:16,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:31:16,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-26 03:31:16,638 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -383997787, now seen corresponding path program 1 times [2020-10-26 03:31:16,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:16,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419585938] [2020-10-26 03:31:16,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:31:16,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-26 03:31:16,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:31:16,853 INFO L384 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 [2020-10-26 03:31:16,853 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:16,859 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:16,859 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:16,859 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-26 03:31:16,935 INFO L384 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 [2020-10-26 03:31:16,935 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:16,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:16,938 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:16,938 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-26 03:31:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:17,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:31:17,104 INFO L384 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 38 treesize of output 32 [2020-10-26 03:31:17,106 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-26 03:31:17,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:17,126 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-26 03:31:17,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2020-10-26 03:31:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:17,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419585938] [2020-10-26 03:31:17,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:17,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2020-10-26 03:31:17,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729147738] [2020-10-26 03:31:17,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 03:31:17,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:17,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 03:31:17,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-26 03:31:17,137 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 11 states. [2020-10-26 03:31:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:17,737 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-10-26 03:31:17,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 03:31:17,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-26 03:31:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:17,750 INFO L225 Difference]: With dead ends: 42 [2020-10-26 03:31:17,751 INFO L226 Difference]: Without dead ends: 42 [2020-10-26 03:31:17,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-26 03:31:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-26 03:31:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2020-10-26 03:31:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-26 03:31:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2020-10-26 03:31:17,766 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 21 [2020-10-26 03:31:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:17,768 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2020-10-26 03:31:17,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 03:31:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-10-26 03:31:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 03:31:17,769 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:17,769 INFO L422 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] [2020-10-26 03:31:17,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-26 03:31:17,983 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:17,984 INFO L82 PathProgramCache]: Analyzing trace with hash 980970590, now seen corresponding path program 1 times [2020-10-26 03:31:17,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:17,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64977940] [2020-10-26 03:31:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:31:18,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-26 03:31:18,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:31:18,259 INFO L384 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 [2020-10-26 03:31:18,260 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:18,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:18,285 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:18,285 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2020-10-26 03:31:18,506 INFO L384 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 [2020-10-26 03:31:18,507 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:18,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:18,520 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:18,521 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2020-10-26 03:31:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:18,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:31:19,374 INFO L384 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 38 treesize of output 32 [2020-10-26 03:31:19,376 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:19,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:19,413 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:19,413 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2020-10-26 03:31:19,516 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-26 03:31:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:19,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64977940] [2020-10-26 03:31:19,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:19,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 20 [2020-10-26 03:31:19,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995726021] [2020-10-26 03:31:19,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-26 03:31:19,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:19,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-26 03:31:19,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2020-10-26 03:31:19,631 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2020-10-26 03:31:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:21,268 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2020-10-26 03:31:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 03:31:21,270 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2020-10-26 03:31:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:21,270 INFO L225 Difference]: With dead ends: 40 [2020-10-26 03:31:21,271 INFO L226 Difference]: Without dead ends: 40 [2020-10-26 03:31:21,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2020-10-26 03:31:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-26 03:31:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-10-26 03:31:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-26 03:31:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-10-26 03:31:21,275 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 22 [2020-10-26 03:31:21,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:21,275 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-10-26 03:31:21,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-26 03:31:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-10-26 03:31:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:31:21,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:21,276 INFO L422 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, 1] [2020-10-26 03:31:21,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-26 03:31:21,480 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:21,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:21,481 INFO L82 PathProgramCache]: Analyzing trace with hash 345317319, now seen corresponding path program 1 times [2020-10-26 03:31:21,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:21,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62032137] [2020-10-26 03:31:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:31:21,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-26 03:31:21,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:31:21,676 INFO L384 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 [2020-10-26 03:31:21,677 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:21,687 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:21,687 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:21,687 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-26 03:31:21,713 INFO L384 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 [2020-10-26 03:31:21,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:21,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:21,725 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:21,726 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2020-10-26 03:31:21,812 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2020-10-26 03:31:21,812 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:21,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:21,815 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:21,815 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-10-26 03:31:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:21,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:31:22,042 INFO L384 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 46 treesize of output 40 [2020-10-26 03:31:22,043 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:22,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:22,074 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:22,074 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:40 [2020-10-26 03:31:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:22,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62032137] [2020-10-26 03:31:22,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:22,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2020-10-26 03:31:22,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711966264] [2020-10-26 03:31:22,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 03:31:22,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:22,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 03:31:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-10-26 03:31:22,182 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 12 states. [2020-10-26 03:31:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:22,968 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-10-26 03:31:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 03:31:22,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-26 03:31:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:22,970 INFO L225 Difference]: With dead ends: 39 [2020-10-26 03:31:22,970 INFO L226 Difference]: Without dead ends: 39 [2020-10-26 03:31:22,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-26 03:31:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-26 03:31:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-26 03:31:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-26 03:31:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-10-26 03:31:22,974 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2020-10-26 03:31:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:22,975 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-10-26 03:31:22,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 03:31:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-10-26 03:31:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:31:22,976 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:22,976 INFO L422 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, 1, 1, 1, 1] [2020-10-26 03:31:23,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-26 03:31:23,181 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash 901678754, now seen corresponding path program 1 times [2020-10-26 03:31:23,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:23,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497938038] [2020-10-26 03:31:23,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:31:23,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-26 03:31:23,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:31:23,416 INFO L384 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 [2020-10-26 03:31:23,416 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:23,430 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,430 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-26 03:31:23,451 INFO L384 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 11 treesize of output 7 [2020-10-26 03:31:23,452 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:23,469 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,469 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2020-10-26 03:31:23,499 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:23,500 INFO L384 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 17 treesize of output 21 [2020-10-26 03:31:23,501 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:23,516 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2020-10-26 03:31:23,558 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-10-26 03:31:23,559 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2020-10-26 03:31:23,560 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:23,571 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:14 [2020-10-26 03:31:23,776 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-26 03:31:23,777 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2020-10-26 03:31:23,778 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:31:23,785 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:31:23,785 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:4 [2020-10-26 03:31:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:23,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-26 03:31:25,129 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-26 03:31:25,130 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 826 treesize of output 746 [2020-10-26 03:31:25,136 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-26 03:31:25,427 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 21 [2020-10-26 03:31:25,429 INFO L625 ElimStorePlain]: treesize reduction 655, result has 3.2 percent of original size [2020-10-26 03:31:25,430 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-26 03:31:25,431 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 03:31:25,431 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:22 [2020-10-26 03:31:25,432 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-26 03:31:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:31:25,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497938038] [2020-10-26 03:31:25,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:31:25,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 18 [2020-10-26 03:31:25,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528286018] [2020-10-26 03:31:25,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-26 03:31:25,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-26 03:31:25,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-26 03:31:25,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-10-26 03:31:25,543 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2020-10-26 03:31:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:31:26,655 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-10-26 03:31:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-26 03:31:26,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-10-26 03:31:26,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:31:26,656 INFO L225 Difference]: With dead ends: 27 [2020-10-26 03:31:26,656 INFO L226 Difference]: Without dead ends: 27 [2020-10-26 03:31:26,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2020-10-26 03:31:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-26 03:31:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-26 03:31:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 03:31:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2020-10-26 03:31:26,661 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2020-10-26 03:31:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:31:26,661 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2020-10-26 03:31:26,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-26 03:31:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-10-26 03:31:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 03:31:26,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:31:26,662 INFO L422 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, 1, 1, 1, 1] [2020-10-26 03:31:26,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-26 03:31:26,872 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2020-10-26 03:31:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:31:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash 856988955, now seen corresponding path program 1 times [2020-10-26 03:31:26,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-26 03:31:26,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563630160] [2020-10-26 03:31:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-26 03:31:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 03:31:27,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 03:31:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 03:31:27,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 03:31:27,246 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-10-26 03:31:27,246 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 03:31:27,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-26 03:31:27,475 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-10-26 03:31:27,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 03:31:27 BoogieIcfgContainer [2020-10-26 03:31:27,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 03:31:27,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 03:31:27,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 03:31:27,492 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 03:31:27,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:30:58" (3/4) ... [2020-10-26 03:31:27,496 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 03:31:27,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 03:31:27,498 INFO L168 Benchmark]: Toolchain (without parser) took 30195.59 ms. Allocated memory was 44.0 MB in the beginning and 81.8 MB in the end (delta: 37.7 MB). Free memory was 28.9 MB in the beginning and 38.8 MB in the end (delta: -9.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 16.1 GB. [2020-10-26 03:31:27,498 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 44.0 MB. Free memory was 26.7 MB in the beginning and 26.6 MB in the end (delta: 28.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:31:27,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.10 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 28.3 MB in the beginning and 25.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2020-10-26 03:31:27,499 INFO L168 Benchmark]: Boogie Preprocessor took 74.71 ms. Allocated memory is still 54.5 MB. Free memory was 25.6 MB in the beginning and 36.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-10-26 03:31:27,500 INFO L168 Benchmark]: RCFGBuilder took 821.91 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 25.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-10-26 03:31:27,500 INFO L168 Benchmark]: TraceAbstraction took 28702.34 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 24.6 MB in the beginning and 38.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 16.1 GB. [2020-10-26 03:31:27,500 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 81.8 MB. Free memory is still 38.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:31:27,503 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 44.0 MB. Free memory was 26.7 MB in the beginning and 26.6 MB in the end (delta: 28.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 577.10 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 28.3 MB in the beginning and 25.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.71 ms. Allocated memory is still 54.5 MB. Free memory was 25.6 MB in the beginning and 36.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 821.91 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 25.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 28702.34 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 24.6 MB in the beginning and 38.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 16.1 GB. * Witness Printer took 4.80 ms. Allocated memory is still 81.8 MB. Free memory is still 38.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; VAL [data={15:0}] [L545] CALL alloc_data(&data) VAL [pdata={15:0}] [L529] pdata->lo = malloc(16) VAL [malloc(16)={1:0}, pdata={15:0}, pdata={15:0}] [L530] pdata->hi = malloc(24) VAL [malloc(16)={1:0}, malloc(24)={2:0}, pdata={15:0}, pdata={15:0}] [L545] RET alloc_data(&data) VAL [data={15:0}] [L546] CALL free_data(&data) VAL [data={15:0}] [L534] EXPR data->lo VAL [data={15:0}, data={15:0}, data->lo={1:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={15:0}, data={15:0}, data->hi={2:0}, lo={1:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={15:0}, data={15:0}, hi={2:0}, lo={1:0}] [L540] data->lo = (void *) 0 VAL [data={15:0}, data={15:0}, hi={2:0}, lo={1:0}] [L541] data->hi = (void *) 0 VAL [data={15:0}, data={15:0}, hi={2:0}, lo={1:0}] [L546] RET free_data(&data) VAL [data={15:0}] [L547] return 0; [L547] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 80 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 253 SDtfs, 324 SDslu, 1019 SDs, 0 SdLazy, 1387 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 197 SyntacticMatches, 10 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 288 ConstructedInterpolants, 34 QuantifiedInterpolants, 38859 SizeOfPredicates, 89 NumberOfNonLiveVariables, 993 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...