./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash b1ecf55fdf540b15366dd2ae5c95c85d044be334 ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash b1ecf55fdf540b15366dd2ae5c95c85d044be334 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:20:12,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:20:12,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:20:12,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:20:12,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:20:12,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:20:12,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:20:12,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:20:12,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:20:12,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:20:12,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:20:12,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:20:12,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:20:12,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:20:12,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:20:12,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:20:12,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:20:12,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:20:12,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:20:12,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:20:12,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:20:12,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:20:12,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:20:12,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:20:12,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:20:12,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:20:12,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:20:12,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:20:12,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:20:12,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:20:12,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:20:12,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:20:12,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:20:12,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:20:12,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:20:12,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:20:12,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:20:12,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:20:12,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:20:12,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:20:12,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:20:12,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-07-29 01:20:12,996 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:20:12,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:20:12,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:20:12,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:20:12,998 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:20:12,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:20:12,999 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:20:12,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:20:13,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:20:13,000 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:20:13,000 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:20:13,000 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:20:13,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:20:13,001 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:20:13,001 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:20:13,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:20:13,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:20:13,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:20:13,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:20:13,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:20:13,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:20:13,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:20:13,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:20:13,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:20:13,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:20:13,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1ecf55fdf540b15366dd2ae5c95c85d044be334 [2020-07-29 01:20:13,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:20:13,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:20:13,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:20:13,327 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:20:13,328 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:20:13,329 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2020-07-29 01:20:13,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4c7fdb56/66f9bbd8e76249fb8b6817fe115e86d2/FLAGabcc4326f [2020-07-29 01:20:13,942 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:20:13,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2020-07-29 01:20:13,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4c7fdb56/66f9bbd8e76249fb8b6817fe115e86d2/FLAGabcc4326f [2020-07-29 01:20:14,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4c7fdb56/66f9bbd8e76249fb8b6817fe115e86d2 [2020-07-29 01:20:14,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:20:14,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:20:14,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:20:14,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:20:14,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:20:14,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:20:14" (1/1) ... [2020-07-29 01:20:14,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36adc6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:14, skipping insertion in model container [2020-07-29 01:20:14,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:20:14" (1/1) ... [2020-07-29 01:20:14,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:20:14,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:20:15,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:20:15,286 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2020-07-29 01:20:15,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3fb1de12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:15, skipping insertion in model container [2020-07-29 01:20:15,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:20:15,288 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2020-07-29 01:20:15,292 INFO L168 Benchmark]: Toolchain (without parser) took 1136.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:20:15,292 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:20:15,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1131.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:20:15,298 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1131.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1504]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:20:17,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:20:17,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:20:17,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:20:17,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:20:17,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:20:17,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:20:17,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:20:17,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:20:17,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:20:17,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:20:17,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:20:17,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:20:17,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:20:17,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:20:17,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:20:17,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:20:17,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:20:17,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:20:17,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:20:17,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:20:17,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:20:17,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:20:17,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:20:17,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:20:17,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:20:17,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:20:17,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:20:17,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:20:17,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:20:17,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:20:17,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:20:17,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:20:17,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:20:17,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:20:17,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:20:17,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:20:17,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:20:17,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:20:17,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:20:17,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:20:17,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2020-07-29 01:20:17,262 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:20:17,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:20:17,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:20:17,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:20:17,265 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:20:17,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:20:17,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:20:17,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:20:17,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:20:17,266 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:20:17,267 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:20:17,268 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:20:17,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:20:17,268 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:20:17,269 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-29 01:20:17,269 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-29 01:20:17,269 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:20:17,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:20:17,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:20:17,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:20:17,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:20:17,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:20:17,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:20:17,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:20:17,271 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-29 01:20:17,271 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-29 01:20:17,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:20:17,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-29 01:20:17,272 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1ecf55fdf540b15366dd2ae5c95c85d044be334 [2020-07-29 01:20:17,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:20:17,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:20:17,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:20:17,641 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:20:17,642 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:20:17,642 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2020-07-29 01:20:17,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41f64e21/d9273e26babd45e1b5251857df270136/FLAGb9d5c555e [2020-07-29 01:20:18,323 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:20:18,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2020-07-29 01:20:18,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41f64e21/d9273e26babd45e1b5251857df270136/FLAGb9d5c555e [2020-07-29 01:20:18,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41f64e21/d9273e26babd45e1b5251857df270136 [2020-07-29 01:20:18,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:20:18,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:20:18,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:20:18,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:20:18,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:20:18,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:20:18" (1/1) ... [2020-07-29 01:20:18,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733dd5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:18, skipping insertion in model container [2020-07-29 01:20:18,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:20:18" (1/1) ... [2020-07-29 01:20:18,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:20:18,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:20:19,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:20:19,402 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-07-29 01:20:19,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:20:19,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:20:19,579 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:20:19,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:20:19,986 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:20:19,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19 WrapperNode [2020-07-29 01:20:19,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:20:19,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:20:19,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:20:19,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:20:20,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (1/1) ... [2020-07-29 01:20:20,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (1/1) ... [2020-07-29 01:20:20,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (1/1) ... [2020-07-29 01:20:20,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (1/1) ... [2020-07-29 01:20:20,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (1/1) ... [2020-07-29 01:20:20,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (1/1) ... [2020-07-29 01:20:20,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (1/1) ... [2020-07-29 01:20:20,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:20:20,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:20:20,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:20:20,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:20:20,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (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-07-29 01:20:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:20:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:20:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:20:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-29 01:20:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:20:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:20:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure syslog [2020-07-29 01:20:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __main [2020-07-29 01:20:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_get_last_path_component_nostrip [2020-07-29 01:20:20,272 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_get_last_path_component_strip [2020-07-29 01:20:20,272 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2020-07-29 01:20:20,272 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2020-07-29 01:20:20,272 INFO L138 BoogieDeclarations]: Found implementation of procedure last_char_is [2020-07-29 01:20:20,272 INFO L138 BoogieDeclarations]: Found implementation of procedure safe_write [2020-07-29 01:20:20,273 INFO L138 BoogieDeclarations]: Found implementation of procedure getutent [2020-07-29 01:20:20,273 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2020-07-29 01:20:20,273 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt_long [2020-07-29 01:20:20,273 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2020-07-29 01:20:20,273 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2020-07-29 01:20:20,274 INFO L138 BoogieDeclarations]: Found implementation of procedure write [2020-07-29 01:20:20,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:20:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-07-29 01:20:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2020-07-29 01:20:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:20:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-29 01:20:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-29 01:20:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2020-07-29 01:20:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:20:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-29 01:20:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:20:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:20:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:20:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_b_loc [2020-07-29 01:20:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_tolower_loc [2020-07-29 01:20:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_toupper_loc [2020-07-29 01:20:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure isalnum [2020-07-29 01:20:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure isalpha [2020-07-29 01:20:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure iscntrl [2020-07-29 01:20:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure isdigit [2020-07-29 01:20:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure islower [2020-07-29 01:20:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure isgraph [2020-07-29 01:20:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure isprint [2020-07-29 01:20:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure ispunct [2020-07-29 01:20:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-07-29 01:20:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure isupper [2020-07-29 01:20:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure isxdigit [2020-07-29 01:20:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure tolower [2020-07-29 01:20:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure toupper [2020-07-29 01:20:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure isblank [2020-07-29 01:20:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-07-29 01:20:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure toascii [2020-07-29 01:20:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure _toupper [2020-07-29 01:20:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure _tolower [2020-07-29 01:20:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure isalnum_l [2020-07-29 01:20:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure isalpha_l [2020-07-29 01:20:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure iscntrl_l [2020-07-29 01:20:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure isdigit_l [2020-07-29 01:20:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure islower_l [2020-07-29 01:20:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure isgraph_l [2020-07-29 01:20:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure isprint_l [2020-07-29 01:20:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure ispunct_l [2020-07-29 01:20:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure isspace_l [2020-07-29 01:20:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure isupper_l [2020-07-29 01:20:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure isxdigit_l [2020-07-29 01:20:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure isblank_l [2020-07-29 01:20:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure __tolower_l [2020-07-29 01:20:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure tolower_l [2020-07-29 01:20:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure __toupper_l [2020-07-29 01:20:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure toupper_l [2020-07-29 01:20:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2020-07-29 01:20:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure getopt_long [2020-07-29 01:20:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure getopt_long_only [2020-07-29 01:20:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-29 01:20:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2020-07-29 01:20:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2020-07-29 01:20:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2020-07-29 01:20:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-07-29 01:20:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2020-07-29 01:20:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-07-29 01:20:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-07-29 01:20:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-07-29 01:20:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2020-07-29 01:20:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-07-29 01:20:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-07-29 01:20:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2020-07-29 01:20:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2020-07-29 01:20:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2020-07-29 01:20:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2020-07-29 01:20:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2020-07-29 01:20:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2020-07-29 01:20:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-07-29 01:20:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-07-29 01:20:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2020-07-29 01:20:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2020-07-29 01:20:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2020-07-29 01:20:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-07-29 01:20:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2020-07-29 01:20:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2020-07-29 01:20:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2020-07-29 01:20:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-07-29 01:20:20,287 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2020-07-29 01:20:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2020-07-29 01:20:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2020-07-29 01:20:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2020-07-29 01:20:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2020-07-29 01:20:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2020-07-29 01:20:20,288 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2020-07-29 01:20:20,289 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2020-07-29 01:20:20,289 INFO L130 BoogieDeclarations]: Found specification of procedure index [2020-07-29 01:20:20,289 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2020-07-29 01:20:20,289 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2020-07-29 01:20:20,289 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2020-07-29 01:20:20,289 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2020-07-29 01:20:20,289 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2020-07-29 01:20:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2020-07-29 01:20:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2020-07-29 01:20:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2020-07-29 01:20:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2020-07-29 01:20:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2020-07-29 01:20:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure access [2020-07-29 01:20:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure faccessat [2020-07-29 01:20:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure lseek [2020-07-29 01:20:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure close [2020-07-29 01:20:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-07-29 01:20:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-07-29 01:20:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure pread [2020-07-29 01:20:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure pwrite [2020-07-29 01:20:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure pipe [2020-07-29 01:20:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure alarm [2020-07-29 01:20:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2020-07-29 01:20:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure ualarm [2020-07-29 01:20:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure usleep [2020-07-29 01:20:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure pause [2020-07-29 01:20:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure chown [2020-07-29 01:20:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure fchown [2020-07-29 01:20:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure lchown [2020-07-29 01:20:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure fchownat [2020-07-29 01:20:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure chdir [2020-07-29 01:20:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure fchdir [2020-07-29 01:20:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure getcwd [2020-07-29 01:20:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure getwd [2020-07-29 01:20:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure dup [2020-07-29 01:20:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure dup2 [2020-07-29 01:20:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure execve [2020-07-29 01:20:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure fexecve [2020-07-29 01:20:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure execv [2020-07-29 01:20:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure execle [2020-07-29 01:20:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure execl [2020-07-29 01:20:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2020-07-29 01:20:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure execlp [2020-07-29 01:20:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure nice [2020-07-29 01:20:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure _exit [2020-07-29 01:20:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure pathconf [2020-07-29 01:20:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure fpathconf [2020-07-29 01:20:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure sysconf [2020-07-29 01:20:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure confstr [2020-07-29 01:20:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure getpid [2020-07-29 01:20:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure getppid [2020-07-29 01:20:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure getpgrp [2020-07-29 01:20:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure __getpgid [2020-07-29 01:20:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure getpgid [2020-07-29 01:20:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure setpgid [2020-07-29 01:20:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure setpgrp [2020-07-29 01:20:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure setsid [2020-07-29 01:20:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure getsid [2020-07-29 01:20:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure getuid [2020-07-29 01:20:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure geteuid [2020-07-29 01:20:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure getgid [2020-07-29 01:20:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure getegid [2020-07-29 01:20:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure getgroups [2020-07-29 01:20:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure setuid [2020-07-29 01:20:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure setreuid [2020-07-29 01:20:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure seteuid [2020-07-29 01:20:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure setgid [2020-07-29 01:20:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure setregid [2020-07-29 01:20:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure setegid [2020-07-29 01:20:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure fork [2020-07-29 01:20:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure vfork [2020-07-29 01:20:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure ttyname [2020-07-29 01:20:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure ttyname_r [2020-07-29 01:20:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure isatty [2020-07-29 01:20:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure ttyslot [2020-07-29 01:20:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure link [2020-07-29 01:20:20,300 INFO L130 BoogieDeclarations]: Found specification of procedure linkat [2020-07-29 01:20:20,301 INFO L130 BoogieDeclarations]: Found specification of procedure symlink [2020-07-29 01:20:20,301 INFO L130 BoogieDeclarations]: Found specification of procedure readlink [2020-07-29 01:20:20,301 INFO L130 BoogieDeclarations]: Found specification of procedure symlinkat [2020-07-29 01:20:20,301 INFO L130 BoogieDeclarations]: Found specification of procedure readlinkat [2020-07-29 01:20:20,301 INFO L130 BoogieDeclarations]: Found specification of procedure unlink [2020-07-29 01:20:20,301 INFO L130 BoogieDeclarations]: Found specification of procedure unlinkat [2020-07-29 01:20:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure rmdir [2020-07-29 01:20:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure tcgetpgrp [2020-07-29 01:20:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure tcsetpgrp [2020-07-29 01:20:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure getlogin [2020-07-29 01:20:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure getlogin_r [2020-07-29 01:20:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure setlogin [2020-07-29 01:20:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure gethostname [2020-07-29 01:20:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure sethostname [2020-07-29 01:20:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure sethostid [2020-07-29 01:20:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure getdomainname [2020-07-29 01:20:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure setdomainname [2020-07-29 01:20:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure vhangup [2020-07-29 01:20:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure revoke [2020-07-29 01:20:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure profil [2020-07-29 01:20:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure acct [2020-07-29 01:20:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure getusershell [2020-07-29 01:20:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure endusershell [2020-07-29 01:20:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure setusershell [2020-07-29 01:20:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure daemon [2020-07-29 01:20:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure chroot [2020-07-29 01:20:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure getpass [2020-07-29 01:20:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure fsync [2020-07-29 01:20:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure gethostid [2020-07-29 01:20:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure sync [2020-07-29 01:20:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure getpagesize [2020-07-29 01:20:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure getdtablesize [2020-07-29 01:20:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure truncate [2020-07-29 01:20:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure ftruncate [2020-07-29 01:20:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure brk [2020-07-29 01:20:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure sbrk [2020-07-29 01:20:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure syscall [2020-07-29 01:20:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure lockf [2020-07-29 01:20:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure fdatasync [2020-07-29 01:20:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:20:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:20:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:20:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:20:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:20:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:20:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:20:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:20:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:20:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:20:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:20:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:20:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:20:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:20:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:20:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:20:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:20:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:20:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:20:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:20:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:20:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:20:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:20:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:20:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:20:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:20:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:20:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:20:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:20:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:20:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:20:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:20:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:20:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:20:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:20:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:20:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:20:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:20:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:20:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:20:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:20:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:20:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:20:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:20:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:20:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:20:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:20:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:20:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:20:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:20:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:20:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:20:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:20:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:20:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-29 01:20:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:20:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:20:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:20:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:20:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:20:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:20:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:20:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:20:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:20:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:20:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:20:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:20:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:20:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:20:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:20:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:20:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:20:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:20:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:20:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:20:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:20:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:20:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:20:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:20:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:20:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:20:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:20:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:20:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:20:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:20:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:20:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:20:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:20:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:20:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:20:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:20:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:20:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:20:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:20:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:20:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:20:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:20:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:20:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:20:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure gettimeofday [2020-07-29 01:20:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure settimeofday [2020-07-29 01:20:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure adjtime [2020-07-29 01:20:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure getitimer [2020-07-29 01:20:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure setitimer [2020-07-29 01:20:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure utimes [2020-07-29 01:20:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure lutimes [2020-07-29 01:20:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure futimes [2020-07-29 01:20:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure login_tty [2020-07-29 01:20:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure login [2020-07-29 01:20:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure logout [2020-07-29 01:20:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure logwtmp [2020-07-29 01:20:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure updwtmp [2020-07-29 01:20:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure utmpname [2020-07-29 01:20:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure getutent [2020-07-29 01:20:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure setutent [2020-07-29 01:20:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure endutent [2020-07-29 01:20:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure getutid [2020-07-29 01:20:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure getutline [2020-07-29 01:20:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure pututline [2020-07-29 01:20:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure getutent_r [2020-07-29 01:20:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure getutid_r [2020-07-29 01:20:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure getutline_r [2020-07-29 01:20:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure bb_get_last_path_component_nostrip [2020-07-29 01:20:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure bb_get_last_path_component_strip [2020-07-29 01:20:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2020-07-29 01:20:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2020-07-29 01:20:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure last_char_is [2020-07-29 01:20:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure safe_write [2020-07-29 01:20:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure syslog [2020-07-29 01:20:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure __main [2020-07-29 01:20:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:20:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:20:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-07-29 01:20:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-07-29 01:20:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-29 01:20:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-29 01:20:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2020-07-29 01:20:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2020-07-29 01:20:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:20:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:20:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:20:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:20:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:20:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-07-29 01:20:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2020-07-29 01:20:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:20:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:20:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2020-07-29 01:20:23,397 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:20:23,398 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-29 01:20:23,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:20:23 BoogieIcfgContainer [2020-07-29 01:20:23,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:20:23,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:20:23,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:20:23,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:20:23,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:20:18" (1/3) ... [2020-07-29 01:20:23,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bd7e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:20:23, skipping insertion in model container [2020-07-29 01:20:23,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:20:19" (2/3) ... [2020-07-29 01:20:23,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bd7e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:20:23, skipping insertion in model container [2020-07-29 01:20:23,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:20:23" (3/3) ... [2020-07-29 01:20:23,414 INFO L109 eAbstractionObserver]: Analyzing ICFG basename-2.i [2020-07-29 01:20:23,425 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:20:23,433 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 138 error locations. [2020-07-29 01:20:23,448 INFO L251 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2020-07-29 01:20:23,470 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:20:23,470 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:20:23,470 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:20:23,470 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:20:23,471 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:20:23,471 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:20:23,471 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:20:23,471 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:20:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2020-07-29 01:20:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:20:23,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:20:23,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:20:23,510 INFO L427 AbstractCegarLoop]: === Iteration 1 === [bb_get_last_path_component_nostripErr1REQUIRES_VIOLATION, bb_get_last_path_component_nostripErr0REQUIRES_VIOLATION, vasprintfErr1REQUIRES_VIOLATION, vasprintfErr6REQUIRES_VIOLATION, vasprintfErr7REQUIRES_VIOLATION, vasprintfErr5REQUIRES_VIOLATION, vasprintfErr10REQUIRES_VIOLATION, vasprintfErr0REQUIRES_VIOLATION, vasprintfErr11REQUIRES_VIOLATION, vasprintfErr9REQUIRES_VIOLATION, vasprintfErr4REQUIRES_VIOLATION, vasprintfErr2REQUIRES_VIOLATION, vasprintfErr3REQUIRES_VIOLATION, vasprintfErr8REQUIRES_VIOLATION, getutentErr7REQUIRES_VIOLATION, getutentErr6REQUIRES_VIOLATION, getutentErr1REQUIRES_VIOLATION, getutentErr0REQUIRES_VIOLATION, getutentErr5REQUIRES_VIOLATION, getutentErr4REQUIRES_VIOLATION, getutentErr3REQUIRES_VIOLATION, getutentErr2REQUIRES_VIOLATION, __mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr5REQUIRES_VIOLATION, __mainErr26REQUIRES_VIOLATION, __mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr7REQUIRES_VIOLATION, __mainErr6REQUIRES_VIOLATION, __mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr8REQUIRES_VIOLATION, __mainErr29REQUIRES_VIOLATION, __mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr31REQUIRES_VIOLATION, __mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr18ASSERT_VIOLATIONMEMORY_LEAK, __mainErr9REQUIRES_VIOLATION, __mainErr30REQUIRES_VIOLATION, __mainErr0REQUIRES_VIOLATION, __mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr42REQUIRES_VIOLATION, __mainErr1REQUIRES_VIOLATION, __mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr4REQUIRES_VIOLATION, __mainErr25REQUIRES_VIOLATION, __mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr38REQUIRES_VIOLATION, __mainErr16REQUIRES_VIOLATION, __mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr37REQUIRES_VIOLATION, __mainErr17REQUIRES_VIOLATION, __mainErr19REQUIRES_VIOLATION, __mainErr41REQUIRES_VIOLATION, __mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr20REQUIRES_VIOLATION, __mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr11REQUIRES_VIOLATION, __mainErr32REQUIRES_VIOLATION, __mainErr10REQUIRES_VIOLATION, __mainErr12REQUIRES_VIOLATION, __mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr13REQUIRES_VIOLATION, __mainErr15REQUIRES_VIOLATION, __mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr14REQUIRES_VIOLATION, readErr1REQUIRES_VIOLATION, readErr0REQUIRES_VIOLATION, getoptErr2REQUIRES_VIOLATION, getoptErr13REQUIRES_VIOLATION, getoptErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr3REQUIRES_VIOLATION, getoptErr10REQUIRES_VIOLATION, getoptErr0REQUIRES_VIOLATION, getoptErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr11REQUIRES_VIOLATION, getoptErr1REQUIRES_VIOLATION, getoptErr12REQUIRES_VIOLATION, getoptErr8REQUIRES_VIOLATION, getoptErr9REQUIRES_VIOLATION, getoptErr6REQUIRES_VIOLATION, getoptErr7REQUIRES_VIOLATION, getopt_longErr2REQUIRES_VIOLATION, getopt_longErr3REQUIRES_VIOLATION, getopt_longErr4REQUIRES_VIOLATION, getopt_longErr5REQUIRES_VIOLATION, getopt_longErr0REQUIRES_VIOLATION, getopt_longErr6REQUIRES_VIOLATION, getopt_longErr1REQUIRES_VIOLATION, getopt_longErr7REQUIRES_VIOLATION, safe_writeErr0REQUIRES_VIOLATION, safe_writeErr1REQUIRES_VIOLATION, bb_get_last_path_component_stripErr3REQUIRES_VIOLATION, bb_get_last_path_component_stripErr2REQUIRES_VIOLATION, bb_get_last_path_component_stripErr0REQUIRES_VIOLATION, bb_get_last_path_component_stripErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, last_char_isErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr4REQUIRES_VIOLATION, last_char_isErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr1REQUIRES_VIOLATION, last_char_isErr5REQUIRES_VIOLATION, last_char_isErr0REQUIRES_VIOLATION]=== [2020-07-29 01:20:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:20:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash -950389044, now seen corresponding path program 1 times [2020-07-29 01:20:23,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:20:23,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568743628] [2020-07-29 01:20:23,536 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-07-29 01:20:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:23,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:20:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:23,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:20:24,020 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-07-29 01:20:24,021 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:20:24,032 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:20:24,032 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:20:24,032 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:20:24,039 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:20:24,040 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_163|]. (= |#valid| (store |v_#valid_163| main_~a~0.base (_ bv1 1))) [2020-07-29 01:20:24,040 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 1) (select |#valid| main_~a~0.base)) [2020-07-29 01:20:24,061 INFO L263 TraceCheckUtils]: 0: Hoare triple {312#true} call ULTIMATE.init(); {312#true} is VALID [2020-07-29 01:20:24,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {312#true} is VALID [2020-07-29 01:20:24,062 INFO L280 TraceCheckUtils]: 2: Hoare triple {312#true} assume true; {312#true} is VALID [2020-07-29 01:20:24,063 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {312#true} {312#true} #746#return; {312#true} is VALID [2020-07-29 01:20:24,063 INFO L263 TraceCheckUtils]: 4: Hoare triple {312#true} call #t~ret139 := main(); {312#true} is VALID [2020-07-29 01:20:24,066 INFO L280 TraceCheckUtils]: 5: Hoare triple {312#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {332#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:20:24,067 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(= (_ bv1 1) (select |#valid| main_~a~0.base))} assume !(1bv1 == #valid[~a~0.base]); {313#false} is VALID [2020-07-29 01:20:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:24,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:20:24,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(= (_ bv1 1) (select |#valid| main_~a~0.base))} assume !(1bv1 == #valid[~a~0.base]); {313#false} is VALID [2020-07-29 01:20:24,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {312#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {332#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:20:24,104 INFO L263 TraceCheckUtils]: 4: Hoare triple {312#true} call #t~ret139 := main(); {312#true} is VALID [2020-07-29 01:20:24,105 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {312#true} {312#true} #746#return; {312#true} is VALID [2020-07-29 01:20:24,105 INFO L280 TraceCheckUtils]: 2: Hoare triple {312#true} assume true; {312#true} is VALID [2020-07-29 01:20:24,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {312#true} is VALID [2020-07-29 01:20:24,105 INFO L263 TraceCheckUtils]: 0: Hoare triple {312#true} call ULTIMATE.init(); {312#true} is VALID [2020-07-29 01:20:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:24,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568743628] [2020-07-29 01:20:24,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:20:24,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-29 01:20:24,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731191935] [2020-07-29 01:20:24,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:20:24,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:20:24,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:20:24,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:24,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:20:24,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:20:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:20:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:20:24,162 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 3 states. [2020-07-29 01:20:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:25,985 INFO L93 Difference]: Finished difference Result 288 states and 324 transitions. [2020-07-29 01:20:25,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:20:25,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:20:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:20:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:20:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2020-07-29 01:20:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:20:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2020-07-29 01:20:26,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 337 transitions. [2020-07-29 01:20:26,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:26,662 INFO L225 Difference]: With dead ends: 288 [2020-07-29 01:20:26,662 INFO L226 Difference]: Without dead ends: 285 [2020-07-29 01:20:26,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:20:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-07-29 01:20:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 269. [2020-07-29 01:20:26,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:20:26,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand 269 states. [2020-07-29 01:20:26,720 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand 269 states. [2020-07-29 01:20:26,720 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 269 states. [2020-07-29 01:20:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:26,745 INFO L93 Difference]: Finished difference Result 285 states and 321 transitions. [2020-07-29 01:20:26,745 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 321 transitions. [2020-07-29 01:20:26,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:20:26,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:20:26,749 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 285 states. [2020-07-29 01:20:26,750 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 285 states. [2020-07-29 01:20:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:26,779 INFO L93 Difference]: Finished difference Result 285 states and 321 transitions. [2020-07-29 01:20:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 321 transitions. [2020-07-29 01:20:26,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:20:26,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:20:26,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:20:26,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:20:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-29 01:20:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2020-07-29 01:20:26,811 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 7 [2020-07-29 01:20:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:20:26,811 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2020-07-29 01:20:26,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:20:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2020-07-29 01:20:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:20:26,812 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:20:26,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:20:27,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-29 01:20:27,027 INFO L427 AbstractCegarLoop]: === Iteration 2 === [bb_get_last_path_component_nostripErr1REQUIRES_VIOLATION, bb_get_last_path_component_nostripErr0REQUIRES_VIOLATION, vasprintfErr1REQUIRES_VIOLATION, vasprintfErr6REQUIRES_VIOLATION, vasprintfErr7REQUIRES_VIOLATION, vasprintfErr5REQUIRES_VIOLATION, vasprintfErr10REQUIRES_VIOLATION, vasprintfErr0REQUIRES_VIOLATION, vasprintfErr11REQUIRES_VIOLATION, vasprintfErr9REQUIRES_VIOLATION, vasprintfErr4REQUIRES_VIOLATION, vasprintfErr2REQUIRES_VIOLATION, vasprintfErr3REQUIRES_VIOLATION, vasprintfErr8REQUIRES_VIOLATION, getutentErr7REQUIRES_VIOLATION, getutentErr6REQUIRES_VIOLATION, getutentErr1REQUIRES_VIOLATION, getutentErr0REQUIRES_VIOLATION, getutentErr5REQUIRES_VIOLATION, getutentErr4REQUIRES_VIOLATION, getutentErr3REQUIRES_VIOLATION, getutentErr2REQUIRES_VIOLATION, __mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr5REQUIRES_VIOLATION, __mainErr26REQUIRES_VIOLATION, __mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr7REQUIRES_VIOLATION, __mainErr6REQUIRES_VIOLATION, __mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr8REQUIRES_VIOLATION, __mainErr29REQUIRES_VIOLATION, __mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr31REQUIRES_VIOLATION, __mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr18ASSERT_VIOLATIONMEMORY_LEAK, __mainErr9REQUIRES_VIOLATION, __mainErr30REQUIRES_VIOLATION, __mainErr0REQUIRES_VIOLATION, __mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr42REQUIRES_VIOLATION, __mainErr1REQUIRES_VIOLATION, __mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr4REQUIRES_VIOLATION, __mainErr25REQUIRES_VIOLATION, __mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr38REQUIRES_VIOLATION, __mainErr16REQUIRES_VIOLATION, __mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr37REQUIRES_VIOLATION, __mainErr17REQUIRES_VIOLATION, __mainErr19REQUIRES_VIOLATION, __mainErr41REQUIRES_VIOLATION, __mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr20REQUIRES_VIOLATION, __mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr11REQUIRES_VIOLATION, __mainErr32REQUIRES_VIOLATION, __mainErr10REQUIRES_VIOLATION, __mainErr12REQUIRES_VIOLATION, __mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr13REQUIRES_VIOLATION, __mainErr15REQUIRES_VIOLATION, __mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr14REQUIRES_VIOLATION, readErr1REQUIRES_VIOLATION, readErr0REQUIRES_VIOLATION, getoptErr2REQUIRES_VIOLATION, getoptErr13REQUIRES_VIOLATION, getoptErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr3REQUIRES_VIOLATION, getoptErr10REQUIRES_VIOLATION, getoptErr0REQUIRES_VIOLATION, getoptErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr11REQUIRES_VIOLATION, getoptErr1REQUIRES_VIOLATION, getoptErr12REQUIRES_VIOLATION, getoptErr8REQUIRES_VIOLATION, getoptErr9REQUIRES_VIOLATION, getoptErr6REQUIRES_VIOLATION, getoptErr7REQUIRES_VIOLATION, getopt_longErr2REQUIRES_VIOLATION, getopt_longErr3REQUIRES_VIOLATION, getopt_longErr4REQUIRES_VIOLATION, getopt_longErr5REQUIRES_VIOLATION, getopt_longErr0REQUIRES_VIOLATION, getopt_longErr6REQUIRES_VIOLATION, getopt_longErr1REQUIRES_VIOLATION, getopt_longErr7REQUIRES_VIOLATION, safe_writeErr0REQUIRES_VIOLATION, safe_writeErr1REQUIRES_VIOLATION, bb_get_last_path_component_stripErr3REQUIRES_VIOLATION, bb_get_last_path_component_stripErr2REQUIRES_VIOLATION, bb_get_last_path_component_stripErr0REQUIRES_VIOLATION, bb_get_last_path_component_stripErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, last_char_isErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr4REQUIRES_VIOLATION, last_char_isErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr1REQUIRES_VIOLATION, last_char_isErr5REQUIRES_VIOLATION, last_char_isErr0REQUIRES_VIOLATION]=== [2020-07-29 01:20:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:20:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash -950389043, now seen corresponding path program 1 times [2020-07-29 01:20:27,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:20:27,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339845681] [2020-07-29 01:20:27,030 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-07-29 01:20:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:27,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:20:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:27,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:20:27,427 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-07-29 01:20:27,428 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:20:27,445 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:20:27,445 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:20:27,446 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:20:27,454 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:20:27,455 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_152|]. (and (= (store |v_#length_152| main_~a~0.base (_ bv11 32)) |#length|) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:20:27,455 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| main_~a~0.base) (_ bv11 32)) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:20:27,473 INFO L263 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2020-07-29 01:20:27,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {1483#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {1483#true} is VALID [2020-07-29 01:20:27,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2020-07-29 01:20:27,474 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #746#return; {1483#true} is VALID [2020-07-29 01:20:27,474 INFO L263 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret139 := main(); {1483#true} is VALID [2020-07-29 01:20:27,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {1483#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {1503#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:27,477 INFO L280 TraceCheckUtils]: 6: Hoare triple {1503#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(10bv32, ~a~0.offset)), #length[~a~0.base]) && ~bvule32(~bvadd32(10bv32, ~a~0.offset), ~bvadd32(1bv32, ~bvadd32(10bv32, ~a~0.offset)))) && ~bvule32(0bv32, ~bvadd32(10bv32, ~a~0.offset))); {1484#false} is VALID [2020-07-29 01:20:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:27,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:20:27,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {1507#(and (bvule (bvadd main_~a~0.offset (_ bv11 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~a~0.offset (_ bv10 32)) (bvadd main_~a~0.offset (_ bv11 32))))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(10bv32, ~a~0.offset)), #length[~a~0.base]) && ~bvule32(~bvadd32(10bv32, ~a~0.offset), ~bvadd32(1bv32, ~bvadd32(10bv32, ~a~0.offset)))) && ~bvule32(0bv32, ~bvadd32(10bv32, ~a~0.offset))); {1484#false} is VALID [2020-07-29 01:20:27,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {1483#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {1507#(and (bvule (bvadd main_~a~0.offset (_ bv11 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~a~0.offset (_ bv10 32)) (bvadd main_~a~0.offset (_ bv11 32))))} is VALID [2020-07-29 01:20:27,591 INFO L263 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret139 := main(); {1483#true} is VALID [2020-07-29 01:20:27,591 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #746#return; {1483#true} is VALID [2020-07-29 01:20:27,591 INFO L280 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2020-07-29 01:20:27,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {1483#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {1483#true} is VALID [2020-07-29 01:20:27,592 INFO L263 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2020-07-29 01:20:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:27,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339845681] [2020-07-29 01:20:27,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:20:27,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-07-29 01:20:27,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195284753] [2020-07-29 01:20:27,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:20:27,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:20:27,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:20:27,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:27,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:20:27,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:20:27,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:20:27,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:20:27,625 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand 4 states. [2020-07-29 01:20:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:30,183 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2020-07-29 01:20:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:20:30,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:20:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:20:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:20:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2020-07-29 01:20:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:20:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2020-07-29 01:20:30,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 304 transitions. [2020-07-29 01:20:30,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:30,658 INFO L225 Difference]: With dead ends: 268 [2020-07-29 01:20:30,658 INFO L226 Difference]: Without dead ends: 268 [2020-07-29 01:20:30,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:20:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-07-29 01:20:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2020-07-29 01:20:30,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:20:30,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand 268 states. [2020-07-29 01:20:30,687 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand 268 states. [2020-07-29 01:20:30,687 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 268 states. [2020-07-29 01:20:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:30,706 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2020-07-29 01:20:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 303 transitions. [2020-07-29 01:20:30,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:20:30,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:20:30,707 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand 268 states. [2020-07-29 01:20:30,707 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 268 states. [2020-07-29 01:20:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:30,721 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2020-07-29 01:20:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 303 transitions. [2020-07-29 01:20:30,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:20:30,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:20:30,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:20:30,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:20:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-07-29 01:20:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 303 transitions. [2020-07-29 01:20:30,737 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 303 transitions. Word has length 7 [2020-07-29 01:20:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:20:30,737 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 303 transitions. [2020-07-29 01:20:30,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:20:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 303 transitions. [2020-07-29 01:20:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:20:30,738 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:20:30,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:20:30,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-29 01:20:30,953 INFO L427 AbstractCegarLoop]: === Iteration 3 === [bb_get_last_path_component_nostripErr1REQUIRES_VIOLATION, bb_get_last_path_component_nostripErr0REQUIRES_VIOLATION, vasprintfErr1REQUIRES_VIOLATION, vasprintfErr6REQUIRES_VIOLATION, vasprintfErr7REQUIRES_VIOLATION, vasprintfErr5REQUIRES_VIOLATION, vasprintfErr10REQUIRES_VIOLATION, vasprintfErr0REQUIRES_VIOLATION, vasprintfErr11REQUIRES_VIOLATION, vasprintfErr9REQUIRES_VIOLATION, vasprintfErr4REQUIRES_VIOLATION, vasprintfErr2REQUIRES_VIOLATION, vasprintfErr3REQUIRES_VIOLATION, vasprintfErr8REQUIRES_VIOLATION, getutentErr7REQUIRES_VIOLATION, getutentErr6REQUIRES_VIOLATION, getutentErr1REQUIRES_VIOLATION, getutentErr0REQUIRES_VIOLATION, getutentErr5REQUIRES_VIOLATION, getutentErr4REQUIRES_VIOLATION, getutentErr3REQUIRES_VIOLATION, getutentErr2REQUIRES_VIOLATION, __mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr5REQUIRES_VIOLATION, __mainErr26REQUIRES_VIOLATION, __mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr7REQUIRES_VIOLATION, __mainErr6REQUIRES_VIOLATION, __mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr8REQUIRES_VIOLATION, __mainErr29REQUIRES_VIOLATION, __mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr31REQUIRES_VIOLATION, __mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr18ASSERT_VIOLATIONMEMORY_LEAK, __mainErr9REQUIRES_VIOLATION, __mainErr30REQUIRES_VIOLATION, __mainErr0REQUIRES_VIOLATION, __mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr42REQUIRES_VIOLATION, __mainErr1REQUIRES_VIOLATION, __mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr4REQUIRES_VIOLATION, __mainErr25REQUIRES_VIOLATION, __mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr38REQUIRES_VIOLATION, __mainErr16REQUIRES_VIOLATION, __mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr37REQUIRES_VIOLATION, __mainErr17REQUIRES_VIOLATION, __mainErr19REQUIRES_VIOLATION, __mainErr41REQUIRES_VIOLATION, __mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr20REQUIRES_VIOLATION, __mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr11REQUIRES_VIOLATION, __mainErr32REQUIRES_VIOLATION, __mainErr10REQUIRES_VIOLATION, __mainErr12REQUIRES_VIOLATION, __mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr13REQUIRES_VIOLATION, __mainErr15REQUIRES_VIOLATION, __mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr14REQUIRES_VIOLATION, readErr1REQUIRES_VIOLATION, readErr0REQUIRES_VIOLATION, getoptErr2REQUIRES_VIOLATION, getoptErr13REQUIRES_VIOLATION, getoptErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr3REQUIRES_VIOLATION, getoptErr10REQUIRES_VIOLATION, getoptErr0REQUIRES_VIOLATION, getoptErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr11REQUIRES_VIOLATION, getoptErr1REQUIRES_VIOLATION, getoptErr12REQUIRES_VIOLATION, getoptErr8REQUIRES_VIOLATION, getoptErr9REQUIRES_VIOLATION, getoptErr6REQUIRES_VIOLATION, getoptErr7REQUIRES_VIOLATION, getopt_longErr2REQUIRES_VIOLATION, getopt_longErr3REQUIRES_VIOLATION, getopt_longErr4REQUIRES_VIOLATION, getopt_longErr5REQUIRES_VIOLATION, getopt_longErr0REQUIRES_VIOLATION, getopt_longErr6REQUIRES_VIOLATION, getopt_longErr1REQUIRES_VIOLATION, getopt_longErr7REQUIRES_VIOLATION, safe_writeErr0REQUIRES_VIOLATION, safe_writeErr1REQUIRES_VIOLATION, bb_get_last_path_component_stripErr3REQUIRES_VIOLATION, bb_get_last_path_component_stripErr2REQUIRES_VIOLATION, bb_get_last_path_component_stripErr0REQUIRES_VIOLATION, bb_get_last_path_component_stripErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, last_char_isErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr4REQUIRES_VIOLATION, last_char_isErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr1REQUIRES_VIOLATION, last_char_isErr5REQUIRES_VIOLATION, last_char_isErr0REQUIRES_VIOLATION]=== [2020-07-29 01:20:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:20:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -615070010, now seen corresponding path program 1 times [2020-07-29 01:20:30,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:20:30,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478938640] [2020-07-29 01:20:30,956 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-07-29 01:20:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:31,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:20:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:31,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:20:31,280 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-07-29 01:20:31,280 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:20:31,294 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:20:31,295 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:20:31,295 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:20:31,300 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:20:31,301 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_157|]. (and (= (store |v_#length_157| main_~a~0.base (_ bv11 32)) |#length|) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:20:31,301 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| main_~a~0.base) (_ bv11 32)) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:20:31,337 INFO L263 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2600#true} is VALID [2020-07-29 01:20:31,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {2600#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {2600#true} is VALID [2020-07-29 01:20:31,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2020-07-29 01:20:31,339 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #746#return; {2600#true} is VALID [2020-07-29 01:20:31,339 INFO L263 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret139 := main(); {2600#true} is VALID [2020-07-29 01:20:31,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {2600#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {2620#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:31,342 INFO L280 TraceCheckUtils]: 6: Hoare triple {2620#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} SUMMARY for call write~intINTTYPE1(0bv8, ~a~0.base, ~bvadd32(10bv32, ~a~0.offset), 1bv32); srcloc: L1584 {2620#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:31,344 INFO L280 TraceCheckUtils]: 7: Hoare triple {2620#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} ~i~3 := 0bv32; {2627#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} is VALID [2020-07-29 01:20:31,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {2627#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} assume !!~bvslt32(~i~3, 10bv32); {2627#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} is VALID [2020-07-29 01:20:31,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {2627#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(~a~0.offset, ~i~3)), #length[~a~0.base]) && ~bvule32(~bvadd32(~a~0.offset, ~i~3), ~bvadd32(1bv32, ~bvadd32(~a~0.offset, ~i~3)))) && ~bvule32(0bv32, ~bvadd32(~a~0.offset, ~i~3))); {2601#false} is VALID [2020-07-29 01:20:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:31,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:20:31,553 INFO L280 TraceCheckUtils]: 9: Hoare triple {2634#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset) (bvadd main_~i~3 main_~a~0.offset (_ bv1 32))))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(~a~0.offset, ~i~3)), #length[~a~0.base]) && ~bvule32(~bvadd32(~a~0.offset, ~i~3), ~bvadd32(1bv32, ~bvadd32(~a~0.offset, ~i~3)))) && ~bvule32(0bv32, ~bvadd32(~a~0.offset, ~i~3))); {2601#false} is VALID [2020-07-29 01:20:31,553 INFO L280 TraceCheckUtils]: 8: Hoare triple {2634#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset) (bvadd main_~i~3 main_~a~0.offset (_ bv1 32))))} assume !!~bvslt32(~i~3, 10bv32); {2634#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset) (bvadd main_~i~3 main_~a~0.offset (_ bv1 32))))} is VALID [2020-07-29 01:20:31,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {2641#(and (bvule (bvadd main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv1 32))))} ~i~3 := 0bv32; {2634#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset) (bvadd main_~i~3 main_~a~0.offset (_ bv1 32))))} is VALID [2020-07-29 01:20:31,555 INFO L280 TraceCheckUtils]: 6: Hoare triple {2641#(and (bvule (bvadd main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv1 32))))} SUMMARY for call write~intINTTYPE1(0bv8, ~a~0.base, ~bvadd32(10bv32, ~a~0.offset), 1bv32); srcloc: L1584 {2641#(and (bvule (bvadd main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv1 32))))} is VALID [2020-07-29 01:20:31,558 INFO L280 TraceCheckUtils]: 5: Hoare triple {2600#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {2641#(and (bvule (bvadd main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv1 32))))} is VALID [2020-07-29 01:20:31,558 INFO L263 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret139 := main(); {2600#true} is VALID [2020-07-29 01:20:31,558 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #746#return; {2600#true} is VALID [2020-07-29 01:20:31,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2020-07-29 01:20:31,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {2600#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {2600#true} is VALID [2020-07-29 01:20:31,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2600#true} is VALID [2020-07-29 01:20:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:31,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478938640] [2020-07-29 01:20:31,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:20:31,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-07-29 01:20:31,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156819064] [2020-07-29 01:20:31,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 01:20:31,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:20:31,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:20:31,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:31,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:20:31,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:20:31,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:20:31,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:20:31,600 INFO L87 Difference]: Start difference. First operand 268 states and 303 transitions. Second operand 6 states. [2020-07-29 01:20:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:37,319 INFO L93 Difference]: Finished difference Result 281 states and 318 transitions. [2020-07-29 01:20:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:20:37,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 01:20:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:20:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:20:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2020-07-29 01:20:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:20:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2020-07-29 01:20:37,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 321 transitions. [2020-07-29 01:20:37,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:37,779 INFO L225 Difference]: With dead ends: 281 [2020-07-29 01:20:37,779 INFO L226 Difference]: Without dead ends: 281 [2020-07-29 01:20:37,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:20:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-07-29 01:20:37,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 274. [2020-07-29 01:20:37,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:20:37,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand 274 states. [2020-07-29 01:20:37,790 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 274 states. [2020-07-29 01:20:37,790 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 274 states. [2020-07-29 01:20:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:37,801 INFO L93 Difference]: Finished difference Result 281 states and 318 transitions. [2020-07-29 01:20:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 318 transitions. [2020-07-29 01:20:37,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:20:37,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:20:37,803 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 281 states. [2020-07-29 01:20:37,803 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 281 states. [2020-07-29 01:20:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:37,814 INFO L93 Difference]: Finished difference Result 281 states and 318 transitions. [2020-07-29 01:20:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 318 transitions. [2020-07-29 01:20:37,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:20:37,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:20:37,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:20:37,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:20:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2020-07-29 01:20:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 310 transitions. [2020-07-29 01:20:37,826 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 310 transitions. Word has length 10 [2020-07-29 01:20:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:20:37,826 INFO L479 AbstractCegarLoop]: Abstraction has 274 states and 310 transitions. [2020-07-29 01:20:37,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:20:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 310 transitions. [2020-07-29 01:20:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:20:37,827 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:20:37,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:20:38,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-29 01:20:38,041 INFO L427 AbstractCegarLoop]: === Iteration 4 === [bb_get_last_path_component_nostripErr1REQUIRES_VIOLATION, bb_get_last_path_component_nostripErr0REQUIRES_VIOLATION, vasprintfErr1REQUIRES_VIOLATION, vasprintfErr6REQUIRES_VIOLATION, vasprintfErr7REQUIRES_VIOLATION, vasprintfErr5REQUIRES_VIOLATION, vasprintfErr10REQUIRES_VIOLATION, vasprintfErr0REQUIRES_VIOLATION, vasprintfErr11REQUIRES_VIOLATION, vasprintfErr9REQUIRES_VIOLATION, vasprintfErr4REQUIRES_VIOLATION, vasprintfErr2REQUIRES_VIOLATION, vasprintfErr3REQUIRES_VIOLATION, vasprintfErr8REQUIRES_VIOLATION, getutentErr7REQUIRES_VIOLATION, getutentErr6REQUIRES_VIOLATION, getutentErr1REQUIRES_VIOLATION, getutentErr0REQUIRES_VIOLATION, getutentErr5REQUIRES_VIOLATION, getutentErr4REQUIRES_VIOLATION, getutentErr3REQUIRES_VIOLATION, getutentErr2REQUIRES_VIOLATION, __mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr5REQUIRES_VIOLATION, __mainErr26REQUIRES_VIOLATION, __mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr7REQUIRES_VIOLATION, __mainErr6REQUIRES_VIOLATION, __mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr8REQUIRES_VIOLATION, __mainErr29REQUIRES_VIOLATION, __mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr31REQUIRES_VIOLATION, __mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr18ASSERT_VIOLATIONMEMORY_LEAK, __mainErr9REQUIRES_VIOLATION, __mainErr30REQUIRES_VIOLATION, __mainErr0REQUIRES_VIOLATION, __mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr42REQUIRES_VIOLATION, __mainErr1REQUIRES_VIOLATION, __mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr4REQUIRES_VIOLATION, __mainErr25REQUIRES_VIOLATION, __mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr38REQUIRES_VIOLATION, __mainErr16REQUIRES_VIOLATION, __mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr37REQUIRES_VIOLATION, __mainErr17REQUIRES_VIOLATION, __mainErr19REQUIRES_VIOLATION, __mainErr41REQUIRES_VIOLATION, __mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr20REQUIRES_VIOLATION, __mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr11REQUIRES_VIOLATION, __mainErr32REQUIRES_VIOLATION, __mainErr10REQUIRES_VIOLATION, __mainErr12REQUIRES_VIOLATION, __mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr13REQUIRES_VIOLATION, __mainErr15REQUIRES_VIOLATION, __mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr14REQUIRES_VIOLATION, readErr1REQUIRES_VIOLATION, readErr0REQUIRES_VIOLATION, getoptErr2REQUIRES_VIOLATION, getoptErr13REQUIRES_VIOLATION, getoptErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr3REQUIRES_VIOLATION, getoptErr10REQUIRES_VIOLATION, getoptErr0REQUIRES_VIOLATION, getoptErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr11REQUIRES_VIOLATION, getoptErr1REQUIRES_VIOLATION, getoptErr12REQUIRES_VIOLATION, getoptErr8REQUIRES_VIOLATION, getoptErr9REQUIRES_VIOLATION, getoptErr6REQUIRES_VIOLATION, getoptErr7REQUIRES_VIOLATION, getopt_longErr2REQUIRES_VIOLATION, getopt_longErr3REQUIRES_VIOLATION, getopt_longErr4REQUIRES_VIOLATION, getopt_longErr5REQUIRES_VIOLATION, getopt_longErr0REQUIRES_VIOLATION, getopt_longErr6REQUIRES_VIOLATION, getopt_longErr1REQUIRES_VIOLATION, getopt_longErr7REQUIRES_VIOLATION, safe_writeErr0REQUIRES_VIOLATION, safe_writeErr1REQUIRES_VIOLATION, bb_get_last_path_component_stripErr3REQUIRES_VIOLATION, bb_get_last_path_component_stripErr2REQUIRES_VIOLATION, bb_get_last_path_component_stripErr0REQUIRES_VIOLATION, bb_get_last_path_component_stripErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, last_char_isErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr4REQUIRES_VIOLATION, last_char_isErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr1REQUIRES_VIOLATION, last_char_isErr5REQUIRES_VIOLATION, last_char_isErr0REQUIRES_VIOLATION]=== [2020-07-29 01:20:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:20:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash 416791152, now seen corresponding path program 1 times [2020-07-29 01:20:38,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:20:38,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106423514] [2020-07-29 01:20:38,045 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-07-29 01:20:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:38,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:20:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:38,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:20:38,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {3784#true} call ULTIMATE.init(); {3784#true} is VALID [2020-07-29 01:20:38,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {3784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {3784#true} is VALID [2020-07-29 01:20:38,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {3784#true} assume true; {3784#true} is VALID [2020-07-29 01:20:38,449 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3784#true} {3784#true} #746#return; {3784#true} is VALID [2020-07-29 01:20:38,449 INFO L263 TraceCheckUtils]: 4: Hoare triple {3784#true} call #t~ret139 := main(); {3784#true} is VALID [2020-07-29 01:20:38,451 INFO L280 TraceCheckUtils]: 5: Hoare triple {3784#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {3784#true} is VALID [2020-07-29 01:20:38,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {3784#true} SUMMARY for call write~intINTTYPE1(0bv8, ~a~0.base, ~bvadd32(10bv32, ~a~0.offset), 1bv32); srcloc: L1584 {3784#true} is VALID [2020-07-29 01:20:38,455 INFO L280 TraceCheckUtils]: 7: Hoare triple {3784#true} ~i~3 := 0bv32; {3810#(= (_ bv0 32) main_~i~3)} is VALID [2020-07-29 01:20:38,456 INFO L280 TraceCheckUtils]: 8: Hoare triple {3810#(= (_ bv0 32) main_~i~3)} assume !!~bvslt32(~i~3, 10bv32); {3810#(= (_ bv0 32) main_~i~3)} is VALID [2020-07-29 01:20:38,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {3810#(= (_ bv0 32) main_~i~3)} SUMMARY for call write~intINTTYPE1(#t~nondet124, ~a~0.base, ~bvadd32(~a~0.offset, ~i~3), 1bv32); srcloc: L1586 {3810#(= (_ bv0 32) main_~i~3)} is VALID [2020-07-29 01:20:38,457 INFO L280 TraceCheckUtils]: 10: Hoare triple {3810#(= (_ bv0 32) main_~i~3)} havoc #t~nondet124; {3810#(= (_ bv0 32) main_~i~3)} is VALID [2020-07-29 01:20:38,458 INFO L280 TraceCheckUtils]: 11: Hoare triple {3810#(= (_ bv0 32) main_~i~3)} #t~pre123 := ~bvadd32(1bv32, ~i~3);~i~3 := ~bvadd32(1bv32, ~i~3);havoc #t~pre123; {3823#(= (_ bv1 32) main_~i~3)} is VALID [2020-07-29 01:20:38,461 INFO L280 TraceCheckUtils]: 12: Hoare triple {3823#(= (_ bv1 32) main_~i~3)} assume !~bvslt32(~i~3, 10bv32); {3785#false} is VALID [2020-07-29 01:20:38,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {3785#false} ~applet_name~0.base, ~applet_name~0.offset := ~a~0.base, ~a~0.offset; {3785#false} is VALID [2020-07-29 01:20:38,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {3785#false} assume !(1bv1 == #valid[~#bb_errno_location~0.base]); {3785#false} is VALID [2020-07-29 01:20:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:38,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:20:38,515 INFO L280 TraceCheckUtils]: 14: Hoare triple {3785#false} assume !(1bv1 == #valid[~#bb_errno_location~0.base]); {3785#false} is VALID [2020-07-29 01:20:38,515 INFO L280 TraceCheckUtils]: 13: Hoare triple {3785#false} ~applet_name~0.base, ~applet_name~0.offset := ~a~0.base, ~a~0.offset; {3785#false} is VALID [2020-07-29 01:20:38,523 INFO L280 TraceCheckUtils]: 12: Hoare triple {3839#(bvslt main_~i~3 (_ bv10 32))} assume !~bvslt32(~i~3, 10bv32); {3785#false} is VALID [2020-07-29 01:20:38,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {3843#(bvslt (bvadd main_~i~3 (_ bv1 32)) (_ bv10 32))} #t~pre123 := ~bvadd32(1bv32, ~i~3);~i~3 := ~bvadd32(1bv32, ~i~3);havoc #t~pre123; {3839#(bvslt main_~i~3 (_ bv10 32))} is VALID [2020-07-29 01:20:38,524 INFO L280 TraceCheckUtils]: 10: Hoare triple {3843#(bvslt (bvadd main_~i~3 (_ bv1 32)) (_ bv10 32))} havoc #t~nondet124; {3843#(bvslt (bvadd main_~i~3 (_ bv1 32)) (_ bv10 32))} is VALID [2020-07-29 01:20:38,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {3843#(bvslt (bvadd main_~i~3 (_ bv1 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(#t~nondet124, ~a~0.base, ~bvadd32(~a~0.offset, ~i~3), 1bv32); srcloc: L1586 {3843#(bvslt (bvadd main_~i~3 (_ bv1 32)) (_ bv10 32))} is VALID [2020-07-29 01:20:38,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {3843#(bvslt (bvadd main_~i~3 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~i~3, 10bv32); {3843#(bvslt (bvadd main_~i~3 (_ bv1 32)) (_ bv10 32))} is VALID [2020-07-29 01:20:38,527 INFO L280 TraceCheckUtils]: 7: Hoare triple {3784#true} ~i~3 := 0bv32; {3843#(bvslt (bvadd main_~i~3 (_ bv1 32)) (_ bv10 32))} is VALID [2020-07-29 01:20:38,527 INFO L280 TraceCheckUtils]: 6: Hoare triple {3784#true} SUMMARY for call write~intINTTYPE1(0bv8, ~a~0.base, ~bvadd32(10bv32, ~a~0.offset), 1bv32); srcloc: L1584 {3784#true} is VALID [2020-07-29 01:20:38,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {3784#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {3784#true} is VALID [2020-07-29 01:20:38,528 INFO L263 TraceCheckUtils]: 4: Hoare triple {3784#true} call #t~ret139 := main(); {3784#true} is VALID [2020-07-29 01:20:38,528 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3784#true} {3784#true} #746#return; {3784#true} is VALID [2020-07-29 01:20:38,528 INFO L280 TraceCheckUtils]: 2: Hoare triple {3784#true} assume true; {3784#true} is VALID [2020-07-29 01:20:38,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {3784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {3784#true} is VALID [2020-07-29 01:20:38,529 INFO L263 TraceCheckUtils]: 0: Hoare triple {3784#true} call ULTIMATE.init(); {3784#true} is VALID [2020-07-29 01:20:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:38,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106423514] [2020-07-29 01:20:38,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:20:38,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-29 01:20:38,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447303960] [2020-07-29 01:20:38,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:20:38,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:20:38,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:20:38,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:38,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:20:38,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:20:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:20:38,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:20:38,575 INFO L87 Difference]: Start difference. First operand 274 states and 310 transitions. Second operand 6 states. [2020-07-29 01:20:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:41,346 INFO L93 Difference]: Finished difference Result 282 states and 317 transitions. [2020-07-29 01:20:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:20:41,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:20:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:20:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:20:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 320 transitions. [2020-07-29 01:20:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:20:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 320 transitions. [2020-07-29 01:20:41,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 320 transitions. [2020-07-29 01:20:41,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:41,796 INFO L225 Difference]: With dead ends: 282 [2020-07-29 01:20:41,796 INFO L226 Difference]: Without dead ends: 282 [2020-07-29 01:20:41,797 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:20:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-29 01:20:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2020-07-29 01:20:41,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:20:41,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 281 states. [2020-07-29 01:20:41,805 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 281 states. [2020-07-29 01:20:41,805 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 281 states. [2020-07-29 01:20:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:41,816 INFO L93 Difference]: Finished difference Result 282 states and 317 transitions. [2020-07-29 01:20:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 317 transitions. [2020-07-29 01:20:41,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:20:41,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:20:41,817 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 282 states. [2020-07-29 01:20:41,817 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 282 states. [2020-07-29 01:20:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:41,829 INFO L93 Difference]: Finished difference Result 282 states and 317 transitions. [2020-07-29 01:20:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 317 transitions. [2020-07-29 01:20:41,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:20:41,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:20:41,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:20:41,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:20:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-07-29 01:20:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 317 transitions. [2020-07-29 01:20:41,841 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 317 transitions. Word has length 15 [2020-07-29 01:20:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:20:41,841 INFO L479 AbstractCegarLoop]: Abstraction has 281 states and 317 transitions. [2020-07-29 01:20:41,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:20:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 317 transitions. [2020-07-29 01:20:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:20:41,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:20:41,842 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:20:42,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-29 01:20:42,058 INFO L427 AbstractCegarLoop]: === Iteration 5 === [bb_get_last_path_component_nostripErr1REQUIRES_VIOLATION, bb_get_last_path_component_nostripErr0REQUIRES_VIOLATION, vasprintfErr1REQUIRES_VIOLATION, vasprintfErr6REQUIRES_VIOLATION, vasprintfErr7REQUIRES_VIOLATION, vasprintfErr5REQUIRES_VIOLATION, vasprintfErr10REQUIRES_VIOLATION, vasprintfErr0REQUIRES_VIOLATION, vasprintfErr11REQUIRES_VIOLATION, vasprintfErr9REQUIRES_VIOLATION, vasprintfErr4REQUIRES_VIOLATION, vasprintfErr2REQUIRES_VIOLATION, vasprintfErr3REQUIRES_VIOLATION, vasprintfErr8REQUIRES_VIOLATION, getutentErr7REQUIRES_VIOLATION, getutentErr6REQUIRES_VIOLATION, getutentErr1REQUIRES_VIOLATION, getutentErr0REQUIRES_VIOLATION, getutentErr5REQUIRES_VIOLATION, getutentErr4REQUIRES_VIOLATION, getutentErr3REQUIRES_VIOLATION, getutentErr2REQUIRES_VIOLATION, __mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr5REQUIRES_VIOLATION, __mainErr26REQUIRES_VIOLATION, __mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr7REQUIRES_VIOLATION, __mainErr6REQUIRES_VIOLATION, __mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr8REQUIRES_VIOLATION, __mainErr29REQUIRES_VIOLATION, __mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr31REQUIRES_VIOLATION, __mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr18ASSERT_VIOLATIONMEMORY_LEAK, __mainErr9REQUIRES_VIOLATION, __mainErr30REQUIRES_VIOLATION, __mainErr0REQUIRES_VIOLATION, __mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr42REQUIRES_VIOLATION, __mainErr1REQUIRES_VIOLATION, __mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr4REQUIRES_VIOLATION, __mainErr25REQUIRES_VIOLATION, __mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr38REQUIRES_VIOLATION, __mainErr16REQUIRES_VIOLATION, __mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr37REQUIRES_VIOLATION, __mainErr17REQUIRES_VIOLATION, __mainErr19REQUIRES_VIOLATION, __mainErr41REQUIRES_VIOLATION, __mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr20REQUIRES_VIOLATION, __mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr11REQUIRES_VIOLATION, __mainErr32REQUIRES_VIOLATION, __mainErr10REQUIRES_VIOLATION, __mainErr12REQUIRES_VIOLATION, __mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr13REQUIRES_VIOLATION, __mainErr15REQUIRES_VIOLATION, __mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr14REQUIRES_VIOLATION, readErr1REQUIRES_VIOLATION, readErr0REQUIRES_VIOLATION, getoptErr2REQUIRES_VIOLATION, getoptErr13REQUIRES_VIOLATION, getoptErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr3REQUIRES_VIOLATION, getoptErr10REQUIRES_VIOLATION, getoptErr0REQUIRES_VIOLATION, getoptErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr11REQUIRES_VIOLATION, getoptErr1REQUIRES_VIOLATION, getoptErr12REQUIRES_VIOLATION, getoptErr8REQUIRES_VIOLATION, getoptErr9REQUIRES_VIOLATION, getoptErr6REQUIRES_VIOLATION, getoptErr7REQUIRES_VIOLATION, getopt_longErr2REQUIRES_VIOLATION, getopt_longErr3REQUIRES_VIOLATION, getopt_longErr4REQUIRES_VIOLATION, getopt_longErr5REQUIRES_VIOLATION, getopt_longErr0REQUIRES_VIOLATION, getopt_longErr6REQUIRES_VIOLATION, getopt_longErr1REQUIRES_VIOLATION, getopt_longErr7REQUIRES_VIOLATION, safe_writeErr0REQUIRES_VIOLATION, safe_writeErr1REQUIRES_VIOLATION, bb_get_last_path_component_stripErr3REQUIRES_VIOLATION, bb_get_last_path_component_stripErr2REQUIRES_VIOLATION, bb_get_last_path_component_stripErr0REQUIRES_VIOLATION, bb_get_last_path_component_stripErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, last_char_isErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr4REQUIRES_VIOLATION, last_char_isErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr1REQUIRES_VIOLATION, last_char_isErr5REQUIRES_VIOLATION, last_char_isErr0REQUIRES_VIOLATION]=== [2020-07-29 01:20:42,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:20:42,059 INFO L82 PathProgramCache]: Analyzing trace with hash -75967412, now seen corresponding path program 1 times [2020-07-29 01:20:42,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:20:42,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092164326] [2020-07-29 01:20:42,060 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-07-29 01:20:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:42,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:20:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:20:42,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:20:42,377 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-07-29 01:20:42,378 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:20:42,388 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:20:42,389 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:20:42,389 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:20:42,396 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:20:42,396 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_165|]. (and (= (store |v_#length_165| main_~a~0.base (_ bv11 32)) |#length|) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:20:42,396 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| main_~a~0.base) (_ bv11 32)) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:20:42,562 INFO L263 TraceCheckUtils]: 0: Hoare triple {5008#true} call ULTIMATE.init(); {5008#true} is VALID [2020-07-29 01:20:42,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {5008#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {5008#true} is VALID [2020-07-29 01:20:42,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {5008#true} assume true; {5008#true} is VALID [2020-07-29 01:20:42,564 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5008#true} {5008#true} #746#return; {5008#true} is VALID [2020-07-29 01:20:42,564 INFO L263 TraceCheckUtils]: 4: Hoare triple {5008#true} call #t~ret139 := main(); {5008#true} is VALID [2020-07-29 01:20:42,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {5008#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {5028#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:42,572 INFO L280 TraceCheckUtils]: 6: Hoare triple {5028#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} SUMMARY for call write~intINTTYPE1(0bv8, ~a~0.base, ~bvadd32(10bv32, ~a~0.offset), 1bv32); srcloc: L1584 {5028#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:42,573 INFO L280 TraceCheckUtils]: 7: Hoare triple {5028#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} ~i~3 := 0bv32; {5035#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} is VALID [2020-07-29 01:20:42,574 INFO L280 TraceCheckUtils]: 8: Hoare triple {5035#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} assume !!~bvslt32(~i~3, 10bv32); {5035#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} is VALID [2020-07-29 01:20:42,575 INFO L280 TraceCheckUtils]: 9: Hoare triple {5035#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} SUMMARY for call write~intINTTYPE1(#t~nondet124, ~a~0.base, ~bvadd32(~a~0.offset, ~i~3), 1bv32); srcloc: L1586 {5035#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} is VALID [2020-07-29 01:20:42,576 INFO L280 TraceCheckUtils]: 10: Hoare triple {5035#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} havoc #t~nondet124; {5035#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} is VALID [2020-07-29 01:20:42,577 INFO L280 TraceCheckUtils]: 11: Hoare triple {5035#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset) (= (_ bv0 32) main_~i~3))} #t~pre123 := ~bvadd32(1bv32, ~i~3);~i~3 := ~bvadd32(1bv32, ~i~3);havoc #t~pre123; {5048#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1 32) main_~i~3) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:42,577 INFO L280 TraceCheckUtils]: 12: Hoare triple {5048#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1 32) main_~i~3) (= (_ bv0 32) main_~a~0.offset))} assume !!~bvslt32(~i~3, 10bv32); {5048#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1 32) main_~i~3) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:42,578 INFO L280 TraceCheckUtils]: 13: Hoare triple {5048#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1 32) main_~i~3) (= (_ bv0 32) main_~a~0.offset))} SUMMARY for call write~intINTTYPE1(#t~nondet124, ~a~0.base, ~bvadd32(~a~0.offset, ~i~3), 1bv32); srcloc: L1586 {5048#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1 32) main_~i~3) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:42,579 INFO L280 TraceCheckUtils]: 14: Hoare triple {5048#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1 32) main_~i~3) (= (_ bv0 32) main_~a~0.offset))} havoc #t~nondet124; {5048#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1 32) main_~i~3) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:42,579 INFO L280 TraceCheckUtils]: 15: Hoare triple {5048#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1 32) main_~i~3) (= (_ bv0 32) main_~a~0.offset))} #t~pre123 := ~bvadd32(1bv32, ~i~3);~i~3 := ~bvadd32(1bv32, ~i~3);havoc #t~pre123; {5061#(and (= (bvadd main_~i~3 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:42,580 INFO L280 TraceCheckUtils]: 16: Hoare triple {5061#(and (= (bvadd main_~i~3 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} assume !!~bvslt32(~i~3, 10bv32); {5061#(and (= (bvadd main_~i~3 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:20:42,581 INFO L280 TraceCheckUtils]: 17: Hoare triple {5061#(and (= (bvadd main_~i~3 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(~a~0.offset, ~i~3)), #length[~a~0.base]) && ~bvule32(~bvadd32(~a~0.offset, ~i~3), ~bvadd32(1bv32, ~bvadd32(~a~0.offset, ~i~3)))) && ~bvule32(0bv32, ~bvadd32(~a~0.offset, ~i~3))); {5009#false} is VALID [2020-07-29 01:20:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:42,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:20:43,105 INFO L280 TraceCheckUtils]: 17: Hoare triple {5068#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset) (bvadd main_~i~3 main_~a~0.offset (_ bv1 32))))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(~a~0.offset, ~i~3)), #length[~a~0.base]) && ~bvule32(~bvadd32(~a~0.offset, ~i~3), ~bvadd32(1bv32, ~bvadd32(~a~0.offset, ~i~3)))) && ~bvule32(0bv32, ~bvadd32(~a~0.offset, ~i~3))); {5009#false} is VALID [2020-07-29 01:20:43,106 INFO L280 TraceCheckUtils]: 16: Hoare triple {5068#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset) (bvadd main_~i~3 main_~a~0.offset (_ bv1 32))))} assume !!~bvslt32(~i~3, 10bv32); {5068#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset) (bvadd main_~i~3 main_~a~0.offset (_ bv1 32))))} is VALID [2020-07-29 01:20:43,510 INFO L280 TraceCheckUtils]: 15: Hoare triple {5075#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv2 32))))} #t~pre123 := ~bvadd32(1bv32, ~i~3);~i~3 := ~bvadd32(1bv32, ~i~3);havoc #t~pre123; {5068#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset) (bvadd main_~i~3 main_~a~0.offset (_ bv1 32))))} is VALID [2020-07-29 01:20:43,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {5075#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv2 32))))} havoc #t~nondet124; {5075#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv2 32))))} is VALID [2020-07-29 01:20:43,512 INFO L280 TraceCheckUtils]: 13: Hoare triple {5075#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv2 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet124, ~a~0.base, ~bvadd32(~a~0.offset, ~i~3), 1bv32); srcloc: L1586 {5075#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv2 32))))} is VALID [2020-07-29 01:20:43,512 INFO L280 TraceCheckUtils]: 12: Hoare triple {5075#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv2 32))))} assume !!~bvslt32(~i~3, 10bv32); {5075#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv2 32))))} is VALID [2020-07-29 01:20:44,067 INFO L280 TraceCheckUtils]: 11: Hoare triple {5088#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv3 32))))} #t~pre123 := ~bvadd32(1bv32, ~i~3);~i~3 := ~bvadd32(1bv32, ~i~3);havoc #t~pre123; {5075#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv1 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv2 32))))} is VALID [2020-07-29 01:20:44,068 INFO L280 TraceCheckUtils]: 10: Hoare triple {5088#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv3 32))))} havoc #t~nondet124; {5088#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv3 32))))} is VALID [2020-07-29 01:20:44,069 INFO L280 TraceCheckUtils]: 9: Hoare triple {5088#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv3 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet124, ~a~0.base, ~bvadd32(~a~0.offset, ~i~3), 1bv32); srcloc: L1586 {5088#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv3 32))))} is VALID [2020-07-29 01:20:44,075 INFO L280 TraceCheckUtils]: 8: Hoare triple {5088#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv3 32))))} assume !!~bvslt32(~i~3, 10bv32); {5088#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv3 32))))} is VALID [2020-07-29 01:20:44,077 INFO L280 TraceCheckUtils]: 7: Hoare triple {5101#(and (bvule (bvadd main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~a~0.offset (_ bv2 32)) (bvadd main_~a~0.offset (_ bv3 32))))} ~i~3 := 0bv32; {5088#(and (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~i~3 main_~a~0.offset (_ bv2 32)) (bvadd main_~i~3 main_~a~0.offset (_ bv3 32))))} is VALID [2020-07-29 01:20:44,078 INFO L280 TraceCheckUtils]: 6: Hoare triple {5101#(and (bvule (bvadd main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~a~0.offset (_ bv2 32)) (bvadd main_~a~0.offset (_ bv3 32))))} SUMMARY for call write~intINTTYPE1(0bv8, ~a~0.base, ~bvadd32(10bv32, ~a~0.offset), 1bv32); srcloc: L1584 {5101#(and (bvule (bvadd main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~a~0.offset (_ bv2 32)) (bvadd main_~a~0.offset (_ bv3 32))))} is VALID [2020-07-29 01:20:44,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {5008#true} call #t~malloc122.base, #t~malloc122.offset := #Ultimate.allocOnHeap(11bv32);~a~0.base, ~a~0.offset := #t~malloc122.base, #t~malloc122.offset; {5101#(and (bvule (bvadd main_~a~0.offset (_ bv3 32)) (select |#length| main_~a~0.base)) (bvule (bvadd main_~a~0.offset (_ bv2 32)) (bvadd main_~a~0.offset (_ bv3 32))))} is VALID [2020-07-29 01:20:44,080 INFO L263 TraceCheckUtils]: 4: Hoare triple {5008#true} call #t~ret139 := main(); {5008#true} is VALID [2020-07-29 01:20:44,081 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5008#true} {5008#true} #746#return; {5008#true} is VALID [2020-07-29 01:20:44,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {5008#true} assume true; {5008#true} is VALID [2020-07-29 01:20:44,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {5008#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, #t~string41.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string41.base, ~bvadd32(1bv32, #t~string41.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string41.base, ~bvadd32(2bv32, #t~string41.offset), 1bv32);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, #t~string42.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string42.base, ~bvadd32(1bv32, #t~string42.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string42.base, ~bvadd32(2bv32, #t~string42.offset), 1bv32);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, #t~string43.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string43.base, ~bvadd32(1bv32, #t~string43.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string43.base, ~bvadd32(2bv32, #t~string43.offset), 1bv32);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, #t~string47.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string47.base, ~bvadd32(1bv32, #t~string47.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string47.base, ~bvadd32(2bv32, #t~string47.offset), 1bv32);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, #t~string50.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string50.base, ~bvadd32(1bv32, #t~string50.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string50.base, ~bvadd32(2bv32, #t~string50.offset), 1bv32);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, #t~string53.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string53.base, ~bvadd32(1bv32, #t~string53.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string53.base, ~bvadd32(2bv32, #t~string53.offset), 1bv32);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, #t~string57.offset, 1bv32);call write~init~intINTTYPE1(45bv8, #t~string57.base, ~bvadd32(1bv32, #t~string57.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string57.base, ~bvadd32(2bv32, #t~string57.offset), 1bv32);~applet_name~0.base, ~applet_name~0.offset := 0bv32, 0bv32;call ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := #Ultimate.allocOnStack(4bv32);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv32);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;call ~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := #Ultimate.allocOnStack(382bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {5008#true} is VALID [2020-07-29 01:20:44,082 INFO L263 TraceCheckUtils]: 0: Hoare triple {5008#true} call ULTIMATE.init(); {5008#true} is VALID [2020-07-29 01:20:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:20:44,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092164326] [2020-07-29 01:20:44,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:20:44,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2020-07-29 01:20:44,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535082587] [2020-07-29 01:20:44,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-29 01:20:44,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:20:44,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:20:45,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:20:45,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:20:45,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:20:45,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:20:45,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:20:45,113 INFO L87 Difference]: Start difference. First operand 281 states and 317 transitions. Second operand 10 states. [2020-07-29 01:20:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:20:59,351 INFO L93 Difference]: Finished difference Result 284 states and 319 transitions. [2020-07-29 01:20:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:20:59,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-29 01:20:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:20:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:20:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 323 transitions. [2020-07-29 01:20:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:20:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 323 transitions. [2020-07-29 01:20:59,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 323 transitions. [2020-07-29 01:21:00,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:21:00,012 INFO L225 Difference]: With dead ends: 284 [2020-07-29 01:21:00,012 INFO L226 Difference]: Without dead ends: 284 [2020-07-29 01:21:00,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:21:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-07-29 01:21:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2020-07-29 01:21:00,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:21:00,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand 284 states. [2020-07-29 01:21:00,021 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 284 states. [2020-07-29 01:21:00,021 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 284 states. [2020-07-29 01:21:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:21:00,032 INFO L93 Difference]: Finished difference Result 284 states and 319 transitions. [2020-07-29 01:21:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 319 transitions. [2020-07-29 01:21:00,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:21:00,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:21:00,033 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 284 states. [2020-07-29 01:21:00,034 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 284 states. [2020-07-29 01:21:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:21:00,044 INFO L93 Difference]: Finished difference Result 284 states and 319 transitions. [2020-07-29 01:21:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 319 transitions. [2020-07-29 01:21:00,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:21:00,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:21:00,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:21:00,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:21:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-07-29 01:21:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 319 transitions. [2020-07-29 01:21:00,055 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 319 transitions. Word has length 18 [2020-07-29 01:21:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:21:00,055 INFO L479 AbstractCegarLoop]: Abstraction has 284 states and 319 transitions. [2020-07-29 01:21:00,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:21:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 319 transitions. [2020-07-29 01:21:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-29 01:21:00,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:21:00,057 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:21:00,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-29 01:21:00,270 INFO L427 AbstractCegarLoop]: === Iteration 6 === [bb_get_last_path_component_nostripErr1REQUIRES_VIOLATION, bb_get_last_path_component_nostripErr0REQUIRES_VIOLATION, vasprintfErr1REQUIRES_VIOLATION, vasprintfErr6REQUIRES_VIOLATION, vasprintfErr7REQUIRES_VIOLATION, vasprintfErr5REQUIRES_VIOLATION, vasprintfErr10REQUIRES_VIOLATION, vasprintfErr0REQUIRES_VIOLATION, vasprintfErr11REQUIRES_VIOLATION, vasprintfErr9REQUIRES_VIOLATION, vasprintfErr4REQUIRES_VIOLATION, vasprintfErr2REQUIRES_VIOLATION, vasprintfErr3REQUIRES_VIOLATION, vasprintfErr8REQUIRES_VIOLATION, getutentErr7REQUIRES_VIOLATION, getutentErr6REQUIRES_VIOLATION, getutentErr1REQUIRES_VIOLATION, getutentErr0REQUIRES_VIOLATION, getutentErr5REQUIRES_VIOLATION, getutentErr4REQUIRES_VIOLATION, getutentErr3REQUIRES_VIOLATION, getutentErr2REQUIRES_VIOLATION, __mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr5REQUIRES_VIOLATION, __mainErr26REQUIRES_VIOLATION, __mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr7REQUIRES_VIOLATION, __mainErr6REQUIRES_VIOLATION, __mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr8REQUIRES_VIOLATION, __mainErr29REQUIRES_VIOLATION, __mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr31REQUIRES_VIOLATION, __mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr18ASSERT_VIOLATIONMEMORY_LEAK, __mainErr9REQUIRES_VIOLATION, __mainErr30REQUIRES_VIOLATION, __mainErr0REQUIRES_VIOLATION, __mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr42REQUIRES_VIOLATION, __mainErr1REQUIRES_VIOLATION, __mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr4REQUIRES_VIOLATION, __mainErr25REQUIRES_VIOLATION, __mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr38REQUIRES_VIOLATION, __mainErr16REQUIRES_VIOLATION, __mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr37REQUIRES_VIOLATION, __mainErr17REQUIRES_VIOLATION, __mainErr19REQUIRES_VIOLATION, __mainErr41REQUIRES_VIOLATION, __mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr20REQUIRES_VIOLATION, __mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr11REQUIRES_VIOLATION, __mainErr32REQUIRES_VIOLATION, __mainErr10REQUIRES_VIOLATION, __mainErr12REQUIRES_VIOLATION, __mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr13REQUIRES_VIOLATION, __mainErr15REQUIRES_VIOLATION, __mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, __mainErr14REQUIRES_VIOLATION, readErr1REQUIRES_VIOLATION, readErr0REQUIRES_VIOLATION, getoptErr2REQUIRES_VIOLATION, getoptErr13REQUIRES_VIOLATION, getoptErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr3REQUIRES_VIOLATION, getoptErr10REQUIRES_VIOLATION, getoptErr0REQUIRES_VIOLATION, getoptErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, getoptErr11REQUIRES_VIOLATION, getoptErr1REQUIRES_VIOLATION, getoptErr12REQUIRES_VIOLATION, getoptErr8REQUIRES_VIOLATION, getoptErr9REQUIRES_VIOLATION, getoptErr6REQUIRES_VIOLATION, getoptErr7REQUIRES_VIOLATION, getopt_longErr2REQUIRES_VIOLATION, getopt_longErr3REQUIRES_VIOLATION, getopt_longErr4REQUIRES_VIOLATION, getopt_longErr5REQUIRES_VIOLATION, getopt_longErr0REQUIRES_VIOLATION, getopt_longErr6REQUIRES_VIOLATION, getopt_longErr1REQUIRES_VIOLATION, getopt_longErr7REQUIRES_VIOLATION, safe_writeErr0REQUIRES_VIOLATION, safe_writeErr1REQUIRES_VIOLATION, bb_get_last_path_component_stripErr3REQUIRES_VIOLATION, bb_get_last_path_component_stripErr2REQUIRES_VIOLATION, bb_get_last_path_component_stripErr0REQUIRES_VIOLATION, bb_get_last_path_component_stripErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, last_char_isErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr4REQUIRES_VIOLATION, last_char_isErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, last_char_isErr1REQUIRES_VIOLATION, last_char_isErr5REQUIRES_VIOLATION, last_char_isErr0REQUIRES_VIOLATION]=== [2020-07-29 01:21:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:21:00,271 INFO L82 PathProgramCache]: Analyzing trace with hash -166605596, now seen corresponding path program 2 times [2020-07-29 01:21:00,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:21:00,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783708381] [2020-07-29 01:21:00,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-07-29 01:21:00,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:21:00,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:21:00,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:21:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:21:00,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:21:01,461 WARN L193 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 45 [2020-07-29 01:21:01,462 INFO L350 Elim1Store]: treesize reduction 916, result has 8.4 percent of original size [2020-07-29 01:21:01,463 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 9 case distinctions, treesize of input 9968 treesize of output 9767 [2020-07-29 01:21:01,474 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:21:02,166 WARN L193 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 66 [2020-07-29 01:21:02,168 INFO L624 ElimStorePlain]: treesize reduction 9262, result has 1.2 percent of original size [2020-07-29 01:21:02,241 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,269 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,280 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,296 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,304 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,322 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,333 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,355 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,364 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,388 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,405 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,417 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,426 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,438 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,452 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,479 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,490 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,504 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,536 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,555 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,569 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,588 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,596 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,606 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,622 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,634 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,646 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,660 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,679 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,693 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,706 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,721 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,738 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,753 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,767 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,778 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,792 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,814 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,825 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,844 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,856 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,874 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,888 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,907 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,924 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,942 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,956 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,974 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:02,987 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,002 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,018 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,036 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,048 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,066 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,083 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,098 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,111 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,128 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,142 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,157 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,171 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,188 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,203 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,218 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,231 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,248 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,266 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,280 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,289 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,311 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,328 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,346 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,356 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,371 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,390 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,407 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,418 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,433 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,444 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,458 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,475 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,487 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,497 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,524 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,541 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,560 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,577 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,592 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,608 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,626 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,641 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,667 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,685 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,706 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,726 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,747 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,765 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,786 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,804 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,825 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,844 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,865 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,882 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,899 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,920 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,948 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,964 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:03,983 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,001 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,022 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,040 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,059 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,076 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,097 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,116 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,136 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,153 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,184 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,201 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,219 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,232 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,249 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,264 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,284 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,298 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,321 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,343 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:04,355 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2020-07-29 01:21:04,355 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:66, output treesize:111 [2020-07-29 01:21:07,289 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:21:07,290 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_183|, |#t~string41.base|, |#t~string42.base|, |#t~string43.base|, |#t~string47.base|, |#t~string50.base|, |#t~string53.base|, |#t~string57.base|, |~#dummy_utmp~0.base|]. (let ((.cse0 (store (store (store (store (store (store (store (store (store |v_#valid_183| (_ bv0 32) (_ bv0 1)) |#t~string41.base| (_ bv1 1)) |#t~string42.base| (_ bv1 1)) |#t~string43.base| (_ bv1 1)) |#t~string47.base| (_ bv1 1)) |#t~string50.base| (_ bv1 1)) |#t~string53.base| (_ bv1 1)) |#t~string57.base| (_ bv1 1)) |~#bb_errno_location~0.base| (_ bv1 1)))) (and (= (select .cse0 |~#dummy_utmp~0.base|) (_ bv0 1)) (= |#valid| (store .cse0 |~#dummy_utmp~0.base| (_ bv1 1))))) [2020-07-29 01:21:07,290 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|#t~string42.base|, |#t~string57.base|, |#t~string41.base|, |#t~string50.base|, |#t~string47.base|, |#t~string43.base|, |~#dummy_utmp~0.base|, |#t~string53.base|]. (and (not (= |#t~string47.base| |~#dummy_utmp~0.base|)) (not (= |#t~string42.base| |~#dummy_utmp~0.base|)) (= (_ bv1 1) (select |#valid| |~#bb_errno_location~0.base|)) (not (= |#t~string41.base| |~#dummy_utmp~0.base|)) (= (select |#valid| |#t~string43.base|) (_ bv1 1)) (= (select |#valid| |#t~string50.base|) (_ bv1 1)) (not (= |#t~string43.base| |~#dummy_utmp~0.base|)) (= (_ bv1 1) (select |#valid| |#t~string42.base|)) (or (= (_ bv0 32) |~#bb_errno_location~0.base|) (= |#t~string42.base| (_ bv0 32)) (= (_ bv0 32) |#t~string57.base|) (= |#t~string41.base| (_ bv0 32)) (= (_ bv0 32) |#t~string50.base|) (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |#t~string47.base| (_ bv0 32)) (= |#t~string43.base| (_ bv0 32)) (= |~#dummy_utmp~0.base| (_ bv0 32)) (= (_ bv0 32) |#t~string53.base|)) (= (_ bv1 1) (select |#valid| |~#dummy_utmp~0.base|)) (= (_ bv1 1) (select |#valid| |#t~string57.base|)) (= (_ bv1 1) (select |#valid| |#t~string47.base|)) (not (= |~#dummy_utmp~0.base| |#t~string53.base|)) (not (= |~#dummy_utmp~0.base| |#t~string57.base|)) (= (select |#valid| |#t~string41.base|) (_ bv1 1)) (not (= |~#dummy_utmp~0.base| |~#bb_errno_location~0.base|)) (not (= |~#dummy_utmp~0.base| |#t~string50.base|)) (= (select |#valid| |#t~string53.base|) (_ bv1 1))) [2020-07-29 01:21:07,338 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,365 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,383 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,405 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,417 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,433 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,458 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,476 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,489 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,506 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,528 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,550 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,568 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,588 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,603 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,631 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,644 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,665 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,686 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,707 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,726 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,743 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,764 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,787 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,815 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,842 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,861 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,884 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,909 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,934 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,955 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,978 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:07,999 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,022 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,043 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,067 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,088 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,108 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,124 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,139 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,154 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,174 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,193 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,212 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,229 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,249 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,269 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,289 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,306 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,326 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,355 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,379 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,398 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,433 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,458 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,482 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,509 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,540 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,568 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,598 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,623 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,653 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,679 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,707 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,734 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,762 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,786 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,815 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,841 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,868 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,889 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,913 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,980 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,990 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:08,997 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,007 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,015 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,026 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,033 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,041 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,048 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,059 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,068 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,077 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,085 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,094 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,112 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,119 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,132 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,141 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,148 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,161 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,168 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,178 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,185 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,195 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,201 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,213 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,227 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,237 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,244 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,254 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,260 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,274 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,283 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,293 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,299 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,310 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,326 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,339 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,353 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,363 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,372 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,384 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,393 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,406 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,415 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,427 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,436 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,447 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,457 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,470 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,480 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,492 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,503 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,516 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:09,525 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:12,766 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-07-29 01:21:12,878 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:12,897 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:12,909 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:12,930 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:12,947 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:12,970 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:12,986 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,004 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,021 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,037 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,048 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,060 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,069 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,084 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,093 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,112 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,124 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,139 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,150 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,164 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,174 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,193 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,215 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,231 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,247 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,272 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,291 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,315 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,333 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,355 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,377 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,400 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,419 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,441 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,460 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,481 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,502 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,529 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,547 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,567 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,592 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,616 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,638 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,663 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,686 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,714 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,741 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,763 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,785 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,810 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,831 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,854 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,873 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,914 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,936 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,959 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:13,980 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,005 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,022 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,042 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,058 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,076 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,091 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,114 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,139 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,178 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,199 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,221 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,242 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,266 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,285 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,302 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,329 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,350 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,368 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,387 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,405 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,426 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,444 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,463 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,482 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,505 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,524 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,557 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,577 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,599 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,620 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,641 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,661 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,683 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,704 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,729 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,750 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,773 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,794 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,818 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,839 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,864 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,887 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,911 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,933 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,957 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:14,983 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,006 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,029 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,053 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,075 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,103 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,125 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,151 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,174 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,203 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,227 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,254 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,278 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,307 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,331 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,361 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,385 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,411 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,436 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,471 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,498 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,533 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,565 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,601 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:15,632 INFO L523 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-07-29 01:21:34,479 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-07-29 01:21:34,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783708381] [2020-07-29 01:21:34,481 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-07-29 01:21:34,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [762925109] [2020-07-29 01:21:34,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-07-29 01:21:35,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:21:35,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:21:35,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:21:35,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:21:35,754 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2020-07-29 01:21:35,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571324428] [2020-07-29 01:21:35,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:21:36,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:21:36,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:21:36,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:21:36,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:21:36,017 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2020-07-29 01:21:36,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:21:36,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-07-29 01:21:36,018 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-07-29 01:21:36,019 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:21:36,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-07-29 01:21:36,645 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-29 01:21:36,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:21:36 BoogieIcfgContainer [2020-07-29 01:21:36,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:21:36,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:21:36,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:21:36,646 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:21:36,646 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:20:23" (3/4) ... [2020-07-29 01:21:36,649 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:21:36,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:21:36,651 INFO L168 Benchmark]: Toolchain (without parser) took 78080.58 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 503.3 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -372.0 MB). Peak memory consumption was 131.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:21:36,651 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:21:36,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1413.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -50.4 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:21:36,653 INFO L168 Benchmark]: Boogie Preprocessor took 206.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 991.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:21:36,654 INFO L168 Benchmark]: RCFGBuilder took 3210.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 991.9 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 200.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:21:36,654 INFO L168 Benchmark]: TraceAbstraction took 73239.27 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 282.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.1 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:21:36,655 INFO L168 Benchmark]: Witness Printer took 3.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:21:36,658 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1413.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -50.4 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 206.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 991.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3210.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 991.9 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 200.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73239.27 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 282.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.1 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1307] static const char *applet_name; [L1308] static signed int bb_errno_location; [L1309] static signed int * const bb_errno = &bb_errno_location; [L1501] static struct utmp dummy_utmp; [L1583] char *a = malloc(11); [L1584] a[10] = 0 [L1585] int i=0; [L1585] COND TRUE i<10 [L1586] a[i]=__VERIFIER_nondet_char() [L1585] ++i [L1585] COND TRUE i<10 [L1586] a[i]=__VERIFIER_nondet_char() [L1585] ++i [L1585] COND TRUE i<10 [L1586] a[i]=__VERIFIER_nondet_char() [L1585] ++i [L1585] COND TRUE i<10 [L1586] a[i]=__VERIFIER_nondet_char() [L1585] ++i [L1585] COND TRUE i<10 [L1586] a[i]=__VERIFIER_nondet_char() [L1585] ++i [L1585] COND FALSE !(i<10) [L1587] applet_name = a [L1588] bb_errno_location = __VERIFIER_nondet_int() - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 416 locations, 138 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 73.1s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1461 SDtfs, 195 SDslu, 2720 SDs, 0 SdLazy, 896 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 8728 SizeOfPredicates, 12 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 0/18 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...