./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-701f399 [2019-11-22 09:52:52,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 09:52:52,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 09:52:52,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 09:52:52,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 09:52:52,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 09:52:52,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 09:52:52,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 09:52:52,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 09:52:52,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 09:52:52,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 09:52:52,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 09:52:52,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 09:52:52,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 09:52:52,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 09:52:52,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 09:52:52,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 09:52:52,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 09:52:52,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 09:52:52,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 09:52:52,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 09:52:52,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 09:52:52,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 09:52:52,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 09:52:52,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 09:52:52,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 09:52:52,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 09:52:52,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 09:52:52,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 09:52:52,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 09:52:52,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 09:52:52,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 09:52:52,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 09:52:52,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 09:52:52,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 09:52:52,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 09:52:52,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 09:52:52,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 09:52:52,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 09:52:52,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 09:52:52,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 09:52:52,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Bitvector.epf [2019-11-22 09:52:52,214 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 09:52:52,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 09:52:52,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 09:52:52,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 09:52:52,216 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 09:52:52,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 09:52:52,216 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 09:52:52,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 09:52:52,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 09:52:52,217 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 09:52:52,217 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 09:52:52,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 09:52:52,217 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 09:52:52,217 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 09:52:52,218 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 09:52:52,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 09:52:52,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 09:52:52,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 09:52:52,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 09:52:52,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 09:52:52,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:52:52,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 09:52:52,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 09:52:52,220 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 09:52:52,220 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 09:52:52,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 09:52:52,220 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-memcleanup) ) 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 -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-22 09:52:52,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 09:52:52,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 09:52:52,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 09:52:52,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 09:52:52,557 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 09:52:52,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-22 09:52:52,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78435eb3c/a8d27735a0804659aa6e4016c6f93812/FLAGaacf6efa4 [2019-11-22 09:52:53,192 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 09:52:53,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-22 09:52:53,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78435eb3c/a8d27735a0804659aa6e4016c6f93812/FLAGaacf6efa4 [2019-11-22 09:52:53,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78435eb3c/a8d27735a0804659aa6e4016c6f93812 [2019-11-22 09:52:53,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 09:52:53,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 09:52:53,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 09:52:53,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 09:52:53,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 09:52:53,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:52:53" (1/1) ... [2019-11-22 09:52:53,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163d8978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:53, skipping insertion in model container [2019-11-22 09:52:53,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:52:53" (1/1) ... [2019-11-22 09:52:53,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 09:52:53,554 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:52:53,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:52:53,957 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 09:52:54,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:52:54,103 INFO L205 MainTranslator]: Completed translation [2019-11-22 09:52:54,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54 WrapperNode [2019-11-22 09:52:54,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 09:52:54,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 09:52:54,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 09:52:54,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 09:52:54,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (1/1) ... [2019-11-22 09:52:54,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (1/1) ... [2019-11-22 09:52:54,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (1/1) ... [2019-11-22 09:52:54,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (1/1) ... [2019-11-22 09:52:54,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (1/1) ... [2019-11-22 09:52:54,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (1/1) ... [2019-11-22 09:52:54,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (1/1) ... [2019-11-22 09:52:54,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 09:52:54,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 09:52:54,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 09:52:54,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 09:52:54,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:52:54,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 09:52:54,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 09:52:54,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:52:54,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 09:52:54,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 09:52:54,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-22 09:52:54,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-22 09:52:54,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-22 09:52:54,267 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-22 09:52:54,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 09:52:54,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 09:52:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 09:52:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 09:52:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 09:52:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 09:52:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 09:52:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 09:52:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 09:52:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 09:52:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 09:52:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 09:52:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 09:52:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 09:52:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 09:52:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 09:52:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 09:52:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 09:52:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 09:52:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 09:52:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 09:52:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-22 09:52:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-22 09:52:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-22 09:52:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 09:52:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 09:52:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 09:52:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 09:52:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 09:52:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 09:52:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 09:52:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 09:52:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 09:52:54,279 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 09:52:54,279 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 09:52:54,279 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 09:52:54,280 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 09:52:54,280 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 09:52:54,280 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 09:52:54,280 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 09:52:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 09:52:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 09:52:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 09:52:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 09:52:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 09:52:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 09:52:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 09:52:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 09:52:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 09:52:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 09:52:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 09:52:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 09:52:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 09:52:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 09:52:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 09:52:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 09:52:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 09:52:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 09:52:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 09:52:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 09:52:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 09:52:54,286 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 09:52:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 09:52:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 09:52:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 09:52:54,288 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 09:52:54,288 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 09:52:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 09:52:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 09:52:54,290 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 09:52:54,290 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 09:52:54,290 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 09:52:54,291 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 09:52:54,291 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 09:52:54,291 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 09:52:54,292 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 09:52:54,292 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 09:52:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 09:52:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 09:52:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 09:52:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 09:52:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 09:52:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 09:52:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 09:52:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 09:52:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 09:52:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 09:52:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 09:52:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 09:52:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 09:52:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 09:52:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 09:52:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 09:52:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 09:52:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 09:52:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 09:52:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 09:52:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 09:52:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 09:52:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 09:52:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 09:52:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 09:52:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-22 09:52:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 09:52:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 09:52:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 09:52:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 09:52:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 09:52:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 09:52:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 09:52:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 09:52:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 09:52:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:52:54,686 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-22 09:52:55,063 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 09:52:55,064 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 09:52:55,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:52:55 BoogieIcfgContainer [2019-11-22 09:52:55,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 09:52:55,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 09:52:55,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 09:52:55,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 09:52:55,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:52:53" (1/3) ... [2019-11-22 09:52:55,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318d4a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:52:55, skipping insertion in model container [2019-11-22 09:52:55,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:52:54" (2/3) ... [2019-11-22 09:52:55,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318d4a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:52:55, skipping insertion in model container [2019-11-22 09:52:55,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:52:55" (3/3) ... [2019-11-22 09:52:55,078 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-22 09:52:55,089 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 09:52:55,100 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-22 09:52:55,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-22 09:52:55,139 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 09:52:55,139 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 09:52:55,139 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 09:52:55,139 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 09:52:55,140 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 09:52:55,140 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 09:52:55,140 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 09:52:55,140 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 09:52:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-22 09:52:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:52:55,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:55,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:52:55,170 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:52:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:55,177 INFO L82 PathProgramCache]: Analyzing trace with hash 889902328, now seen corresponding path program 1 times [2019-11-22 09:52:55,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:55,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1740162126] [2019-11-22 09:52:55,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:55,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:52:55,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:55,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:52:55,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:55,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:55,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:55,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 09:52:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:55,566 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:55,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1740162126] [2019-11-22 09:52:55,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:52:55,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:52:55,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554144123] [2019-11-22 09:52:55,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:52:55,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:55,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:52:55,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:52:55,612 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-22 09:52:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:55,959 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-22 09:52:55,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:52:55,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 09:52:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:55,971 INFO L225 Difference]: With dead ends: 99 [2019-11-22 09:52:55,971 INFO L226 Difference]: Without dead ends: 91 [2019-11-22 09:52:55,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:52:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-22 09:52:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-11-22 09:52:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-22 09:52:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-22 09:52:56,020 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-22 09:52:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:56,020 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-22 09:52:56,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:52:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-22 09:52:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:52:56,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:56,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:52:56,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:56,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:52:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash 889902329, now seen corresponding path program 1 times [2019-11-22 09:52:56,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:56,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1375098401] [2019-11-22 09:52:56,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:56,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 09:52:56,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:56,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:52:56,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:56,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:56,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:56,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:52:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:56,499 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:56,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1375098401] [2019-11-22 09:52:56,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:52:56,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 09:52:56,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978529986] [2019-11-22 09:52:56,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 09:52:56,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 09:52:56,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 09:52:56,630 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 6 states. [2019-11-22 09:52:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:57,078 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-22 09:52:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:52:57,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-22 09:52:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:57,082 INFO L225 Difference]: With dead ends: 95 [2019-11-22 09:52:57,082 INFO L226 Difference]: Without dead ends: 95 [2019-11-22 09:52:57,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:52:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-22 09:52:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-11-22 09:52:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-22 09:52:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-22 09:52:57,094 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2019-11-22 09:52:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:57,094 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-22 09:52:57,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 09:52:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-22 09:52:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 09:52:57,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:57,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:52:57,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:57,307 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:52:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:57,308 INFO L82 PathProgramCache]: Analyzing trace with hash -525648670, now seen corresponding path program 1 times [2019-11-22 09:52:57,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:57,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1130558849] [2019-11-22 09:52:57,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:57,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:52:57,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:57,511 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:57,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1130558849] [2019-11-22 09:52:57,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:52:57,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:52:57,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816099673] [2019-11-22 09:52:57,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:52:57,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:57,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:52:57,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:52:57,521 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 4 states. [2019-11-22 09:52:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:57,795 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-22 09:52:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:52:57,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 09:52:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:57,798 INFO L225 Difference]: With dead ends: 91 [2019-11-22 09:52:57,798 INFO L226 Difference]: Without dead ends: 91 [2019-11-22 09:52:57,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:52:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-22 09:52:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-22 09:52:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-22 09:52:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-22 09:52:57,806 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2019-11-22 09:52:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:57,807 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-22 09:52:57,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:52:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-22 09:52:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:52:57,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:57,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:52:58,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:58,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:52:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash 884806317, now seen corresponding path program 1 times [2019-11-22 09:52:58,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:58,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1726074019] [2019-11-22 09:52:58,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:58,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:52:58,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:58,221 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:58,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726074019] [2019-11-22 09:52:58,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:52:58,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 09:52:58,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494071352] [2019-11-22 09:52:58,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 09:52:58,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 09:52:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:52:58,239 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-11-22 09:52:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:58,487 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-22 09:52:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:52:58,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 09:52:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:58,490 INFO L225 Difference]: With dead ends: 95 [2019-11-22 09:52:58,490 INFO L226 Difference]: Without dead ends: 95 [2019-11-22 09:52:58,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:52:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-22 09:52:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-11-22 09:52:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-22 09:52:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-22 09:52:58,499 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 19 [2019-11-22 09:52:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:58,499 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-22 09:52:58,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 09:52:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-22 09:52:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:52:58,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:58,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:52:58,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:58,705 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:52:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:58,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2141888629, now seen corresponding path program 1 times [2019-11-22 09:52:58,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:58,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1014183767] [2019-11-22 09:52:58,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:58,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-22 09:52:58,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:58,917 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:58,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1014183767] [2019-11-22 09:52:58,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:52:58,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 09:52:58,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479274599] [2019-11-22 09:52:58,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:52:58,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:52:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:52:58,945 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 4 states. [2019-11-22 09:52:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:58,970 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-11-22 09:52:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:52:58,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-22 09:52:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:58,972 INFO L225 Difference]: With dead ends: 137 [2019-11-22 09:52:58,972 INFO L226 Difference]: Without dead ends: 137 [2019-11-22 09:52:58,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:52:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-22 09:52:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 96. [2019-11-22 09:52:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-22 09:52:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2019-11-22 09:52:58,988 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 19 [2019-11-22 09:52:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:58,988 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2019-11-22 09:52:58,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:52:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2019-11-22 09:52:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:52:58,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:58,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:52:59,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:59,197 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:52:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1857254037, now seen corresponding path program 1 times [2019-11-22 09:52:59,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:59,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1089262694] [2019-11-22 09:52:59,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:59,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 09:52:59,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:59,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 09:52:59,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:59,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:59,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:59,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-22 09:52:59,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-22 09:52:59,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:59,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:59,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:59,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-22 09:52:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:59,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:59,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-22 09:52:59,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 09:52:59,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:59,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-22 09:52:59,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-22 09:52:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:59,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1089262694] [2019-11-22 09:52:59,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:52:59,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-22 09:52:59,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460863419] [2019-11-22 09:52:59,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 09:52:59,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:59,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 09:52:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-22 09:52:59,561 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand 11 states. [2019-11-22 09:53:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:53:00,372 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2019-11-22 09:53:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 09:53:00,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-22 09:53:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:53:00,374 INFO L225 Difference]: With dead ends: 194 [2019-11-22 09:53:00,375 INFO L226 Difference]: Without dead ends: 188 [2019-11-22 09:53:00,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-22 09:53:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-22 09:53:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 102. [2019-11-22 09:53:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 09:53:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-11-22 09:53:00,384 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2019-11-22 09:53:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:53:00,384 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-11-22 09:53:00,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 09:53:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-11-22 09:53:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:53:00,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:53:00,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:53:00,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:00,591 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:53:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:53:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1662752270, now seen corresponding path program 1 times [2019-11-22 09:53:00,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:53:00,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [813841334] [2019-11-22 09:53:00,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:53:00,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 09:53:00,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:53:00,822 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:00,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-22 09:53:00,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:00,847 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-22 09:53:00,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:00,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 09:53:00,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:53:00,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:00,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:00,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:00,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-22 09:53:00,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-22 09:53:00,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:00,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:00,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:00,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-22 09:53:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:00,945 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:53:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:00,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [813841334] [2019-11-22 09:53:00,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:53:00,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-22 09:53:00,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564636270] [2019-11-22 09:53:00,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:53:00,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:53:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:53:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:53:00,990 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2019-11-22 09:53:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:53:01,546 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-22 09:53:01,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 09:53:01,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-22 09:53:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:53:01,549 INFO L225 Difference]: With dead ends: 115 [2019-11-22 09:53:01,549 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 09:53:01,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:53:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 09:53:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-11-22 09:53:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-22 09:53:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-11-22 09:53:01,556 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 19 [2019-11-22 09:53:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:53:01,556 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-11-22 09:53:01,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:53:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-11-22 09:53:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:53:01,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:53:01,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:53:01,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:01,760 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:53:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:53:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1662752269, now seen corresponding path program 1 times [2019-11-22 09:53:01,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:53:01,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1013790441] [2019-11-22 09:53:01,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:53:01,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 09:53:01,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:53:01,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:53:01,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:01,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:01,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:01,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:53:02,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:53:02,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:02,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:02,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:53:02,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:02,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:02,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:02,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-22 09:53:02,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-22 09:53:02,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:02,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:02,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-22 09:53:02,094 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:02,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:02,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:02,100 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:11 [2019-11-22 09:53:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:02,134 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:53:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:02,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1013790441] [2019-11-22 09:53:02,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:53:02,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:53:02,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007113230] [2019-11-22 09:53:02,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:53:02,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:53:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:53:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:53:02,363 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-11-22 09:53:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:53:03,512 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-22 09:53:03,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 09:53:03,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 09:53:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:53:03,515 INFO L225 Difference]: With dead ends: 125 [2019-11-22 09:53:03,515 INFO L226 Difference]: Without dead ends: 125 [2019-11-22 09:53:03,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-22 09:53:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-22 09:53:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-11-22 09:53:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-22 09:53:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-22 09:53:03,523 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 19 [2019-11-22 09:53:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:53:03,523 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-22 09:53:03,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:53:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-22 09:53:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 09:53:03,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:53:03,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:53:03,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:03,726 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:53:03,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:53:03,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1657775174, now seen corresponding path program 1 times [2019-11-22 09:53:03,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:53:03,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1961369167] [2019-11-22 09:53:03,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:53:03,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 09:53:03,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:53:03,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:53:03,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:03,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:03,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:03,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 09:53:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:04,005 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:53:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:08,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1961369167] [2019-11-22 09:53:08,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:53:08,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:53:08,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242643686] [2019-11-22 09:53:08,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:53:08,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:53:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:53:08,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2019-11-22 09:53:08,151 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 10 states. [2019-11-22 09:53:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:53:08,729 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-22 09:53:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 09:53:08,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-22 09:53:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:53:08,731 INFO L225 Difference]: With dead ends: 111 [2019-11-22 09:53:08,731 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 09:53:08,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=44, Invalid=110, Unknown=2, NotChecked=0, Total=156 [2019-11-22 09:53:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 09:53:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-22 09:53:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-22 09:53:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-11-22 09:53:08,737 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 20 [2019-11-22 09:53:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:53:08,737 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-11-22 09:53:08,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:53:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-11-22 09:53:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 09:53:08,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:53:08,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:53:08,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:08,943 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:53:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:53:08,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1659192231, now seen corresponding path program 1 times [2019-11-22 09:53:08,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:53:08,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [731589097] [2019-11-22 09:53:08,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:53:09,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:53:09,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:53:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:09,131 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:53:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:09,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [731589097] [2019-11-22 09:53:09,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:53:09,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 09:53:09,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584386583] [2019-11-22 09:53:09,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 09:53:09,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:53:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 09:53:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:53:09,145 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 5 states. [2019-11-22 09:53:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:53:09,439 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-11-22 09:53:09,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:53:09,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-22 09:53:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:53:09,441 INFO L225 Difference]: With dead ends: 106 [2019-11-22 09:53:09,442 INFO L226 Difference]: Without dead ends: 106 [2019-11-22 09:53:09,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:53:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-22 09:53:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-22 09:53:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-22 09:53:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2019-11-22 09:53:09,447 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 20 [2019-11-22 09:53:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:53:09,447 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2019-11-22 09:53:09,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 09:53:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2019-11-22 09:53:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 09:53:09,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:53:09,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:53:09,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:09,652 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:53:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:53:09,652 INFO L82 PathProgramCache]: Analyzing trace with hash -104648209, now seen corresponding path program 1 times [2019-11-22 09:53:09,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:53:09,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [240876494] [2019-11-22 09:53:09,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:53:09,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:53:09,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:53:09,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 09:53:09,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:09,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:09,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:09,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-22 09:53:09,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-22 09:53:09,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:09,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:09,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:09,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-22 09:53:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:09,972 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:53:10,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:10,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2019-11-22 09:53:10,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:10,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:10,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:10,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:53:10,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:53:10,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:10,162 INFO L567 ElimStorePlain]: treesize reduction 43, result has 25.9 percent of original size [2019-11-22 09:53:10,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-22 09:53:10,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-22 09:53:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:10,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [240876494] [2019-11-22 09:53:10,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:53:10,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-22 09:53:10,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834007241] [2019-11-22 09:53:10,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 09:53:10,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:53:10,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 09:53:10,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-22 09:53:10,186 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 13 states. [2019-11-22 09:53:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:53:10,795 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2019-11-22 09:53:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 09:53:10,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-22 09:53:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:53:10,797 INFO L225 Difference]: With dead ends: 113 [2019-11-22 09:53:10,797 INFO L226 Difference]: Without dead ends: 106 [2019-11-22 09:53:10,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-11-22 09:53:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-22 09:53:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-11-22 09:53:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-22 09:53:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-22 09:53:10,802 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 21 [2019-11-22 09:53:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:53:10,802 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-22 09:53:10,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 09:53:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-22 09:53:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-22 09:53:10,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:53:10,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:53:11,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:11,006 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:53:11,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:53:11,007 INFO L82 PathProgramCache]: Analyzing trace with hash 773245120, now seen corresponding path program 1 times [2019-11-22 09:53:11,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:53:11,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1014326035] [2019-11-22 09:53:11,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:53:11,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 09:53:11,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:53:11,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:53:11,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:53:11,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 09:53:11,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-22 09:53:11,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 09:53:11,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-22 09:53:11,397 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_24|], 2=[|v_#memory_int_26|]} [2019-11-22 09:53:11,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:53:11,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:53:11,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-22 09:53:11,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-22 09:53:11,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 09:53:11,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-22 09:53:11,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-22 09:53:11,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:11,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-11-22 09:53:11,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-22 09:53:11,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:11,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2019-11-22 09:53:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:11,753 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:53:11,975 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:11,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:11,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:11,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-22 09:53:14,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 266 [2019-11-22 09:53:14,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 09:53:14,465 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2019-11-22 09:53:14,467 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.6 percent of original size [2019-11-22 09:53:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:14,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-22 09:53:14,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-11-22 09:53:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:14,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1014326035] [2019-11-22 09:53:14,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:53:14,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 09:53:14,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590543075] [2019-11-22 09:53:14,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 09:53:14,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:53:14,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 09:53:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-11-22 09:53:14,737 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 22 states. [2019-11-22 09:53:16,245 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-22 09:53:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:53:17,387 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-11-22 09:53:17,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 09:53:17,388 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-22 09:53:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:53:17,388 INFO L225 Difference]: With dead ends: 100 [2019-11-22 09:53:17,389 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 09:53:17,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=259, Invalid=1000, Unknown=1, NotChecked=0, Total=1260 [2019-11-22 09:53:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 09:53:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2019-11-22 09:53:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-22 09:53:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2019-11-22 09:53:17,393 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 29 [2019-11-22 09:53:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:53:17,393 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2019-11-22 09:53:17,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 09:53:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2019-11-22 09:53:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 09:53:17,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:53:17,395 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:53:17,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:17,600 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:53:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:53:17,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1399266987, now seen corresponding path program 1 times [2019-11-22 09:53:17,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:53:17,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [232581452] [2019-11-22 09:53:17,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:53:17,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-22 09:53:17,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:53:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 09:53:17,794 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:53:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 09:53:17,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [232581452] [2019-11-22 09:53:17,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:53:17,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:53:17,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325780512] [2019-11-22 09:53:17,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:53:17,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:53:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:53:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:53:17,805 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2019-11-22 09:53:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:53:17,826 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2019-11-22 09:53:17,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:53:17,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-22 09:53:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:53:17,828 INFO L225 Difference]: With dead ends: 124 [2019-11-22 09:53:17,828 INFO L226 Difference]: Without dead ends: 124 [2019-11-22 09:53:17,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:53:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-22 09:53:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 90. [2019-11-22 09:53:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-22 09:53:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2019-11-22 09:53:17,832 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2019-11-22 09:53:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:53:17,833 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2019-11-22 09:53:17,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:53:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2019-11-22 09:53:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 09:53:17,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:53:17,836 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:53:18,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:18,037 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:53:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:53:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash -33706853, now seen corresponding path program 1 times [2019-11-22 09:53:18,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:53:18,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [245888126] [2019-11-22 09:53:18,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:53:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:53:18,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-22 09:53:18,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:53:18,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:53:18,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:53:18,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 09:53:18,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-22 09:53:18,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 09:53:18,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-22 09:53:18,439 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_36|]} [2019-11-22 09:53:18,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:53:18,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:53:18,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-22 09:53:18,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,517 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:34 [2019-11-22 09:53:18,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 09:53:18,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-11-22 09:53:18,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-22 09:53:18,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-22 09:53:18,675 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 09:53:18,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-22 09:53:18,724 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_33|], 6=[|v_#memory_int_38|]} [2019-11-22 09:53:18,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:53:18,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:53:18,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-11-22 09:53:18,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:36 [2019-11-22 09:53:18,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 09:53:18,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:18,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:18,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2019-11-22 09:53:18,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:18,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-22 09:53:18,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:19,051 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-22 09:53:19,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:19,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:19,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:43 [2019-11-22 09:53:19,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:19,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:19,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-22 09:53:19,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:19,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:19,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:53:19,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2019-11-22 09:53:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:19,279 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:53:19,398 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:19,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:19,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:19,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-22 09:53:21,506 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-22 09:53:27,612 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-22 09:53:31,734 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-22 09:53:37,866 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-22 09:53:37,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:37,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-22 09:53:37,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:53:37,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:37,915 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:37,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:53:37,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 09:53:37,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:41 [2019-11-22 09:53:45,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 746 [2019-11-22 09:53:45,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 09:53:46,395 WARN L192 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-11-22 09:53:46,395 INFO L567 ElimStorePlain]: treesize reduction 659, result has 10.6 percent of original size [2019-11-22 09:53:46,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:53:46,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:46,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:53:46,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-22 09:53:46,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:59 [2019-11-22 09:53:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:53:46,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [245888126] [2019-11-22 09:53:46,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:53:46,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-22 09:53:46,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377148453] [2019-11-22 09:53:46,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-22 09:53:46,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:53:46,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-22 09:53:46,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=672, Unknown=7, NotChecked=0, Total=812 [2019-11-22 09:53:46,676 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 29 states. [2019-11-22 09:53:50,786 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-22 09:53:55,055 WARN L192 SmtUtils]: Spent 4.13 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-22 09:54:09,264 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-11-22 09:54:23,582 WARN L192 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-22 09:54:43,901 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-11-22 09:54:54,168 WARN L192 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-11-22 09:55:08,827 WARN L192 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-22 09:55:21,495 WARN L192 SmtUtils]: Spent 12.37 s on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-11-22 09:55:42,006 WARN L192 SmtUtils]: Spent 12.15 s on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-11-22 09:55:54,339 WARN L192 SmtUtils]: Spent 10.30 s on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-22 09:56:10,285 WARN L192 SmtUtils]: Spent 12.76 s on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-22 09:56:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:56:14,299 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-11-22 09:56:14,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-22 09:56:14,302 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-22 09:56:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:56:14,302 INFO L225 Difference]: With dead ends: 67 [2019-11-22 09:56:14,302 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 09:56:14,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 134.9s TimeCoverageRelationStatistics Valid=567, Invalid=2279, Unknown=16, NotChecked=0, Total=2862 [2019-11-22 09:56:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 09:56:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 09:56:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 09:56:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 09:56:14,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-22 09:56:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:56:14,304 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 09:56:14,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-22 09:56:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 09:56:14,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 09:56:14,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:56:14,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:56:14 BoogieIcfgContainer [2019-11-22 09:56:14,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 09:56:14,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 09:56:14,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 09:56:14,512 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 09:56:14,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:52:55" (3/4) ... [2019-11-22 09:56:14,515 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 09:56:14,523 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:56:14,523 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 09:56:14,523 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-22 09:56:14,523 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 09:56:14,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 09:56:14,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-22 09:56:14,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-22 09:56:14,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 09:56:14,525 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-22 09:56:14,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-22 09:56:14,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 09:56:14,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 09:56:14,532 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 09:56:14,583 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 09:56:14,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 09:56:14,584 INFO L168 Benchmark]: Toolchain (without parser) took 201091.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -205.1 MB). Peak memory consumption was 118.4 MB. Max. memory is 11.5 GB. [2019-11-22 09:56:14,585 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:56:14,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 09:56:14,586 INFO L168 Benchmark]: Boogie Preprocessor took 98.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-22 09:56:14,586 INFO L168 Benchmark]: RCFGBuilder took 864.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-11-22 09:56:14,587 INFO L168 Benchmark]: TraceAbstraction took 199441.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.4 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. [2019-11-22 09:56:14,591 INFO L168 Benchmark]: Witness Printer took 71.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-22 09:56:14,593 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 864.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 199441.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.4 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. * Witness Printer took 71.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 101 locations, 29 error locations. Result: SAFE, OverallTime: 199.3s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 155.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 638 SDtfs, 1872 SDslu, 2061 SDs, 0 SdLazy, 2329 SolverSat, 366 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 44.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 468 SyntacticMatches, 7 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 144.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 278 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 37.7s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 566 ConstructedInterpolants, 41 QuantifiedInterpolants, 98108 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1157 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 28 InterpolantComputations, 24 PerfectInterpolantSequences, 34/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...