./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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-ext-properties/simple-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:22:24,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 10:22:24,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 10:22:24,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 10:22:24,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 10:22:24,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 10:22:24,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 10:22:24,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 10:22:24,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 10:22:24,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 10:22:24,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 10:22:24,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 10:22:24,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 10:22:24,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 10:22:24,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 10:22:24,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 10:22:24,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 10:22:24,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 10:22:24,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 10:22:24,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 10:22:24,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 10:22:24,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 10:22:24,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 10:22:24,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 10:22:24,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 10:22:24,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 10:22:24,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 10:22:24,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 10:22:24,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 10:22:24,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 10:22:24,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 10:22:24,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 10:22:24,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 10:22:24,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 10:22:24,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 10:22:24,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 10:22:24,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 10:22:24,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 10:22:24,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 10:22:24,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 10:22:24,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 10:22:24,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-22 10:22:24,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 10:22:24,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 10:22:24,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 10:22:24,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 10:22:24,098 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 10:22:24,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 10:22:24,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 10:22:24,099 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 10:22:24,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 10:22:24,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 10:22:24,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 10:22:24,101 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 10:22:24,101 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 10:22:24,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 10:22:24,101 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 10:22:24,102 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 10:22:24,102 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 10:22:24,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 10:22:24,103 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 10:22:24,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 10:22:24,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 10:22:24,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 10:22:24,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 10:22:24,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:22:24,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 10:22:24,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 10:22:24,105 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 10:22:24,105 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 10:22:24,106 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 10:22:24,106 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-22 10:22:24,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 10:22:24,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 10:22:24,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 10:22:24,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 10:22:24,436 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 10:22:24,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-22 10:22:24,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9056517a8/95641d179bd84a4d8af45bb9426a660f/FLAGcb1e742e9 [2019-11-22 10:22:25,064 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 10:22:25,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-22 10:22:25,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9056517a8/95641d179bd84a4d8af45bb9426a660f/FLAGcb1e742e9 [2019-11-22 10:22:25,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9056517a8/95641d179bd84a4d8af45bb9426a660f [2019-11-22 10:22:25,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 10:22:25,350 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 10:22:25,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 10:22:25,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 10:22:25,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 10:22:25,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:25,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794a621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25, skipping insertion in model container [2019-11-22 10:22:25,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:25,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 10:22:25,418 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:22:25,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:22:25,858 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 10:22:25,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:22:25,992 INFO L205 MainTranslator]: Completed translation [2019-11-22 10:22:25,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25 WrapperNode [2019-11-22 10:22:25,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 10:22:25,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 10:22:25,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 10:22:25,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 10:22:26,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:26,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:26,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:26,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:26,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:26,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:26,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (1/1) ... [2019-11-22 10:22:26,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 10:22:26,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 10:22:26,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 10:22:26,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 10:22:26,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (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 10:22:26,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 10:22:26,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 10:22:26,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:22:26,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 10:22:26,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 10:22:26,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-22 10:22:26,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-22 10:22:26,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-22 10:22:26,142 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-22 10:22:26,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 10:22:26,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 10:22:26,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 10:22:26,143 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 10:22:26,143 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 10:22:26,143 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 10:22:26,144 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 10:22:26,144 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 10:22:26,144 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 10:22:26,144 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 10:22:26,144 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 10:22:26,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 10:22:26,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 10:22:26,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 10:22:26,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 10:22:26,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 10:22:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 10:22:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 10:22:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 10:22:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 10:22:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 10:22:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-22 10:22:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-22 10:22:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-22 10:22:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 10:22:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 10:22:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 10:22:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 10:22:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 10:22:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 10:22:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 10:22:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 10:22:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 10:22:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 10:22:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 10:22:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 10:22:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 10:22:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 10:22:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 10:22:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 10:22:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 10:22:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 10:22:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 10:22:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 10:22:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 10:22:26,152 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 10:22:26,152 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 10:22:26,152 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 10:22:26,152 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 10:22:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 10:22:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 10:22:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 10:22:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 10:22:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 10:22:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 10:22:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 10:22:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 10:22:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 10:22:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 10:22:26,155 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 10:22:26,155 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 10:22:26,155 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 10:22:26,155 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 10:22:26,155 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 10:22:26,156 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 10:22:26,156 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 10:22:26,156 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 10:22:26,156 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 10:22:26,156 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 10:22:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 10:22:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 10:22:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 10:22:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 10:22:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 10:22:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 10:22:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 10:22:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 10:22:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 10:22:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 10:22:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 10:22:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 10:22:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 10:22:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 10:22:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 10:22:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 10:22:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 10:22:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 10:22:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 10:22:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 10:22:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 10:22:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 10:22:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 10:22:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 10:22:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 10:22:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 10:22:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 10:22:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 10:22:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 10:22:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 10:22:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 10:22:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 10:22:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 10:22:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 10:22:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 10:22:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 10:22:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 10:22:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 10:22:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 10:22:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 10:22:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 10:22:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-22 10:22:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 10:22:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 10:22:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 10:22:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 10:22:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 10:22:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 10:22:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 10:22:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 10:22:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 10:22:26,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:22:26,531 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-22 10:22:26,880 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 10:22:26,880 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 10:22:26,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:22:26 BoogieIcfgContainer [2019-11-22 10:22:26,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 10:22:26,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 10:22:26,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 10:22:26,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 10:22:26,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:22:25" (1/3) ... [2019-11-22 10:22:26,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2024ca70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:22:26, skipping insertion in model container [2019-11-22 10:22:26,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:22:25" (2/3) ... [2019-11-22 10:22:26,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2024ca70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:22:26, skipping insertion in model container [2019-11-22 10:22:26,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:22:26" (3/3) ... [2019-11-22 10:22:26,901 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-ext.i [2019-11-22 10:22:26,913 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 10:22:26,925 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 10:22:26,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 10:22:26,960 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 10:22:26,961 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 10:22:26,961 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 10:22:26,961 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 10:22:26,961 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 10:22:26,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 10:22:26,962 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 10:22:26,962 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 10:22:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-22 10:22:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:22:26,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:22:26,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:22:26,999 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:22:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:22:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 56539660, now seen corresponding path program 1 times [2019-11-22 10:22:27,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:22:27,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1212960990] [2019-11-22 10:22:27,021 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 10:22:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:22:27,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:22:27,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:22:27,321 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 10:22:27,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:27,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:27,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:22:27,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 10:22:27,354 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 10:22:27,355 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:22:27,372 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 10:22:27,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1212960990] [2019-11-22 10:22:27,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:22:27,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:22:27,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533854585] [2019-11-22 10:22:27,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:22:27,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:22:27,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:22:27,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:22:27,400 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2019-11-22 10:22:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:22:27,721 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-11-22 10:22:27,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:22:27,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 10:22:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:22:27,733 INFO L225 Difference]: With dead ends: 77 [2019-11-22 10:22:27,733 INFO L226 Difference]: Without dead ends: 68 [2019-11-22 10:22:27,736 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 10:22:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-22 10:22:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2019-11-22 10:22:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 10:22:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-22 10:22:27,782 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 10 [2019-11-22 10:22:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:22:27,782 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-22 10:22:27,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:22:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-22 10:22:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:22:27,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:22:27,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:22:27,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:22:27,997 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:22:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:22:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash 56539661, now seen corresponding path program 1 times [2019-11-22 10:22:27,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:22:27,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1574108836] [2019-11-22 10:22:27,999 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 10:22:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:22:28,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 10:22:28,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:22:28,212 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 10:22:28,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:28,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:28,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:22:28,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:22:28,251 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 10:22:28,252 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:22:28,345 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 10:22:28,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1574108836] [2019-11-22 10:22:28,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:22:28,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 10:22:28,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589852781] [2019-11-22 10:22:28,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 10:22:28,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:22:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 10:22:28,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:22:28,349 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 6 states. [2019-11-22 10:22:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:22:28,781 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-22 10:22:28,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:22:28,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-22 10:22:28,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:22:28,784 INFO L225 Difference]: With dead ends: 73 [2019-11-22 10:22:28,784 INFO L226 Difference]: Without dead ends: 73 [2019-11-22 10:22:28,785 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 10:22:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-22 10:22:28,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2019-11-22 10:22:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 10:22:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-22 10:22:28,794 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 10 [2019-11-22 10:22:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:22:28,794 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-22 10:22:28,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 10:22:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-22 10:22:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 10:22:28,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:22:28,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:22:28,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:22:28,999 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:22:28,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:22:28,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1628877614, now seen corresponding path program 1 times [2019-11-22 10:22:29,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:22:29,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1684995889] [2019-11-22 10:22:29,005 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 10:22:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:22:29,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:22:29,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:22:29,200 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 10:22:29,200 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:22:29,213 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 10:22:29,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1684995889] [2019-11-22 10:22:29,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:22:29,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 10:22:29,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108535801] [2019-11-22 10:22:29,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:22:29,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:22:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:22:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:22:29,216 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 4 states. [2019-11-22 10:22:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:22:29,428 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-22 10:22:29,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:22:29,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-22 10:22:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:22:29,429 INFO L225 Difference]: With dead ends: 69 [2019-11-22 10:22:29,430 INFO L226 Difference]: Without dead ends: 69 [2019-11-22 10:22:29,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:22:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-22 10:22:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-22 10:22:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 10:22:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-11-22 10:22:29,445 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 17 [2019-11-22 10:22:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:22:29,446 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-11-22 10:22:29,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:22:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-11-22 10:22:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 10:22:29,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:22:29,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:22:29,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:22:29,649 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:22:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:22:29,650 INFO L82 PathProgramCache]: Analyzing trace with hash -888671678, now seen corresponding path program 1 times [2019-11-22 10:22:29,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:22:29,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1582912126] [2019-11-22 10:22:29,652 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 10:22:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:22:29,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 10:22:29,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:22:29,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:29,887 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 10:22:29,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:29,908 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-22 10:22:29,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:22:29,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 10:22:29,925 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 10:22:29,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:29,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:29,938 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 10:22:29,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-22 10:22:29,964 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 10:22:29,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:29,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:29,971 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 10:22:29,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-22 10:22:29,995 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 10:22:29,996 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:22:30,033 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 10:22:30,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1582912126] [2019-11-22 10:22:30,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:22:30,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-22 10:22:30,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678272888] [2019-11-22 10:22:30,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:22:30,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:22:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:22:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:22:30,035 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 8 states. [2019-11-22 10:22:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:22:30,679 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-11-22 10:22:30,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 10:22:30,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-22 10:22:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:22:30,681 INFO L225 Difference]: With dead ends: 82 [2019-11-22 10:22:30,681 INFO L226 Difference]: Without dead ends: 82 [2019-11-22 10:22:30,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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 10:22:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-22 10:22:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2019-11-22 10:22:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 10:22:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-22 10:22:30,690 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2019-11-22 10:22:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:22:30,691 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-22 10:22:30,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:22:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-22 10:22:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 10:22:30,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:22:30,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:22:30,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:22:30,901 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:22:30,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:22:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash -888671677, now seen corresponding path program 1 times [2019-11-22 10:22:30,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:22:30,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1978516464] [2019-11-22 10:22:30,904 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 10:22:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:22:31,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 10:22:31,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:22:31,106 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 10:22:31,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:31,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:31,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:22:31,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:22:31,134 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 10:22:31,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:31,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:31,154 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 10:22:31,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:31,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:31,180 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 10:22:31,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-22 10:22:31,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-22 10:22:31,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:31,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:31,237 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 10:22:31,238 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:31,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:31,247 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 10:22:31,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-22 10:22:31,279 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 10:22:31,279 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:22:31,538 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 10:22:31,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1978516464] [2019-11-22 10:22:31,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:22:31,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:22:31,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582192914] [2019-11-22 10:22:31,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:22:31,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:22:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:22:31,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:22:31,541 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 10 states. [2019-11-22 10:22:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:22:32,754 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-11-22 10:22:32,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 10:22:32,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-22 10:22:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:22:32,756 INFO L225 Difference]: With dead ends: 88 [2019-11-22 10:22:32,756 INFO L226 Difference]: Without dead ends: 88 [2019-11-22 10:22:32,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-22 10:22:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-22 10:22:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 48. [2019-11-22 10:22:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-22 10:22:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-11-22 10:22:32,763 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2019-11-22 10:22:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:22:32,764 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-11-22 10:22:32,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:22:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-11-22 10:22:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:22:32,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:22:32,765 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:22:32,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:22:32,968 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:22:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:22:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash -739303751, now seen corresponding path program 1 times [2019-11-22 10:22:32,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:22:32,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2020328040] [2019-11-22 10:22:32,970 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 10:22:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:22:33,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 10:22:33,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:22:33,196 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 10:22:33,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:33,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:33,214 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 10:22:33,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:33,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:33,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:22:33,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-22 10:22:33,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 10:22:33,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:33,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:33,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 10:22:33,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:33,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:33,303 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 10:22:33,303 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-22 10:22:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:22:33,331 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:22:33,401 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 35 treesize of output 29 [2019-11-22 10:22:33,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 10:22:33,417 INFO L567 ElimStorePlain]: treesize reduction 19, result has 36.7 percent of original size [2019-11-22 10:22:33,417 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-22 10:22:33,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-22 10:22:33,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2019-11-22 10:22:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:22:33,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2020328040] [2019-11-22 10:22:33,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:22:33,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-11-22 10:22:33,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991187759] [2019-11-22 10:22:33,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 10:22:33,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:22:33,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 10:22:33,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-22 10:22:33,445 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 11 states. [2019-11-22 10:22:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:22:34,042 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-11-22 10:22:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 10:22:34,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-22 10:22:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:22:34,045 INFO L225 Difference]: With dead ends: 89 [2019-11-22 10:22:34,045 INFO L226 Difference]: Without dead ends: 89 [2019-11-22 10:22:34,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-22 10:22:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-22 10:22:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 58. [2019-11-22 10:22:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-22 10:22:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-11-22 10:22:34,052 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2019-11-22 10:22:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:22:34,053 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-11-22 10:22:34,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 10:22:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-11-22 10:22:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 10:22:34,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:22:34,054 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] [2019-11-22 10:22:34,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:22:34,257 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:22:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:22:34,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1885491277, now seen corresponding path program 1 times [2019-11-22 10:22:34,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:22:34,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [950014730] [2019-11-22 10:22:34,259 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 10:22:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:22:34,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:22:34,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:22:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 10:22:34,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:22:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 10:22:34,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [950014730] [2019-11-22 10:22:34,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:22:34,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:22:34,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730617623] [2019-11-22 10:22:34,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:22:34,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:22:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:22:34,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:22:34,482 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 4 states. [2019-11-22 10:22:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:22:34,690 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-22 10:22:34,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:22:34,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 10:22:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:22:34,692 INFO L225 Difference]: With dead ends: 66 [2019-11-22 10:22:34,692 INFO L226 Difference]: Without dead ends: 66 [2019-11-22 10:22:34,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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 10:22:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-22 10:22:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2019-11-22 10:22:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-22 10:22:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-11-22 10:22:34,699 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 24 [2019-11-22 10:22:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:22:34,700 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-11-22 10:22:34,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:22:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-11-22 10:22:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 10:22:34,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:22:34,701 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-22 10:22:34,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:22:34,904 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:22:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:22:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash 849527619, now seen corresponding path program 1 times [2019-11-22 10:22:34,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:22:34,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1660951200] [2019-11-22 10:22:34,906 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 10:22:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:22:35,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 10:22:35,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:22:35,160 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 10:22:35,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:35,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:35,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:22:35,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:22:35,214 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:35,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-22 10:22:35,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:35,267 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-22 10:22:35,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:22:35,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-22 10:22:35,298 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 10:22:35,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:35,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:35,319 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 10:22:35,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-22 10:22:43,596 WARN L192 SmtUtils]: Spent 8.18 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-22 10:22:43,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:43,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 56 [2019-11-22 10:22:43,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:43,639 INFO L567 ElimStorePlain]: treesize reduction 34, result has 44.3 percent of original size [2019-11-22 10:22:43,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:22:43,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:27 [2019-11-22 10:22:43,696 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:43,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 65 [2019-11-22 10:22:43,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:43,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:43,752 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.6 percent of original size [2019-11-22 10:22:43,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:22:43,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2019-11-22 10:22:43,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:43,882 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-11-22 10:22:43,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:22:43,901 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-22 10:22:43,903 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 10:22:43,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:17 [2019-11-22 10:22:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:22:43,967 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:22:44,129 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 10:22:44,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:22:44,158 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 10:22:44,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:26 [2019-11-22 10:22:46,955 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 236 treesize of output 230 [2019-11-22 10:22:46,957 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 10:22:47,275 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-22 10:22:47,276 INFO L567 ElimStorePlain]: treesize reduction 66, result has 71.3 percent of original size [2019-11-22 10:22:47,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 34 dim-0 vars, and 7 xjuncts. [2019-11-22 10:22:47,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:1138 [2019-11-22 10:22:47,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:22:47,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,655 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 27 [2019-11-22 10:22:47,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:47,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:22:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:22:50,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1660951200] [2019-11-22 10:22:50,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:22:50,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-11-22 10:22:50,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299966733] [2019-11-22 10:22:50,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 10:22:50,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:22:50,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 10:22:50,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=420, Unknown=1, NotChecked=0, Total=506 [2019-11-22 10:22:50,014 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 23 states. [2019-11-22 10:23:00,012 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-11-22 10:23:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:00,585 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2019-11-22 10:23:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-22 10:23:00,586 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-11-22 10:23:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:00,587 INFO L225 Difference]: With dead ends: 117 [2019-11-22 10:23:00,587 INFO L226 Difference]: Without dead ends: 117 [2019-11-22 10:23:00,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=277, Invalid=1128, Unknown=1, NotChecked=0, Total=1406 [2019-11-22 10:23:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-22 10:23:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 76. [2019-11-22 10:23:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-22 10:23:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-11-22 10:23:00,595 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 26 [2019-11-22 10:23:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:00,595 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-11-22 10:23:00,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 10:23:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-11-22 10:23:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 10:23:00,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:00,597 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-22 10:23:00,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:00,806 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 10:23:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash 849527620, now seen corresponding path program 1 times [2019-11-22 10:23:00,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:00,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2147472734] [2019-11-22 10:23:00,807 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 10:23:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:01,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 10:23:01,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:01,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 10:23:01,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:23:01,103 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 10:23:01,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-22 10:23:01,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,142 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 10:23:01,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-22 10:23:01,179 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_25|]} [2019-11-22 10:23:01,185 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 10:23:01,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:23:01,229 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 27 treesize of output 11 [2019-11-22 10:23:01,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,254 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 10:23:01,254 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-11-22 10:23:01,298 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 10:23:01,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-11-22 10:23:01,359 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 19 treesize of output 18 [2019-11-22 10:23:01,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,370 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 10:23:01,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2019-11-22 10:23:01,377 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 27 treesize of output 11 [2019-11-22 10:23:01,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,396 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 10:23:01,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2019-11-22 10:23:01,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 10:23:01,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:01,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,451 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 10:23:01,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-22 10:23:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:01,475 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:01,546 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 10:23:01,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,553 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 10:23:01,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-22 10:23:01,936 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 10:23:01,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:01,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:01,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2019-11-22 10:23:11,087 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 3190 treesize of output 3158 [2019-11-22 10:23:11,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 10:23:12,410 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 159 DAG size of output: 53 [2019-11-22 10:23:12,411 INFO L567 ElimStorePlain]: treesize reduction 3016, result has 3.2 percent of original size [2019-11-22 10:23:12,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:23:12,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:12,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:12,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:12,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:12,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:12,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-22 10:23:12,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:59 [2019-11-22 10:23:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:13,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2147472734] [2019-11-22 10:23:13,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:23:13,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-11-22 10:23:13,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915379378] [2019-11-22 10:23:13,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 10:23:13,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:13,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 10:23:13,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=416, Unknown=4, NotChecked=0, Total=506 [2019-11-22 10:23:13,269 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 23 states. [2019-11-22 10:23:14,754 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-11-22 10:23:15,039 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-11-22 10:23:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:15,089 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-11-22 10:23:15,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 10:23:15,090 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-11-22 10:23:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:15,090 INFO L225 Difference]: With dead ends: 41 [2019-11-22 10:23:15,090 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 10:23:15,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=232, Invalid=756, Unknown=4, NotChecked=0, Total=992 [2019-11-22 10:23:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 10:23:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 10:23:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 10:23:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 10:23:15,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-22 10:23:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:15,092 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 10:23:15,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 10:23:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 10:23:15,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 10:23:15,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:15,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:23:15 BoogieIcfgContainer [2019-11-22 10:23:15,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 10:23:15,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 10:23:15,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 10:23:15,300 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 10:23:15,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:22:26" (3/4) ... [2019-11-22 10:23:15,304 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 10:23:15,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:23:15,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 10:23:15,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-22 10:23:15,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 10:23:15,311 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 10:23:15,311 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-22 10:23:15,311 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-22 10:23:15,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 10:23:15,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-22 10:23:15,318 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-22 10:23:15,318 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-22 10:23:15,319 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 10:23:15,319 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 10:23:15,369 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 10:23:15,369 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 10:23:15,371 INFO L168 Benchmark]: Toolchain (without parser) took 50021.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 963.1 MB in the beginning and 1.2 GB in the end (delta: -195.6 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. [2019-11-22 10:23:15,371 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:23:15,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-22 10:23:15,372 INFO L168 Benchmark]: Boogie Preprocessor took 77.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:23:15,373 INFO L168 Benchmark]: RCFGBuilder took 808.90 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-11-22 10:23:15,373 INFO L168 Benchmark]: TraceAbstraction took 48416.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.7 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2019-11-22 10:23:15,373 INFO L168 Benchmark]: Witness Printer took 69.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:23:15,375 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 808.90 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48416.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.7 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. * Witness Printer took 69.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: 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: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free 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: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: 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: 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: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: 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: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 82 locations, 20 error locations. Result: SAFE, OverallTime: 48.3s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 256 SDtfs, 825 SDslu, 768 SDs, 0 SdLazy, 1794 SolverSat, 254 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 245 SyntacticMatches, 4 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 170 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 314 ConstructedInterpolants, 27 QuantifiedInterpolants, 59319 SizeOfPredicates, 81 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 12/22 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...