./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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 09:51:53,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 09:51:53,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 09:51:53,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 09:51:53,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 09:51:53,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 09:51:53,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 09:51:53,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 09:51:53,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 09:51:53,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 09:51:53,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 09:51:53,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 09:51:53,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 09:51:53,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 09:51:53,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 09:51:53,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 09:51:53,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 09:51:53,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 09:51:53,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 09:51:53,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 09:51:53,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 09:51:53,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 09:51:53,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 09:51:53,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 09:51:53,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 09:51:53,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 09:51:53,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 09:51:53,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 09:51:53,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 09:51:53,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 09:51:53,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 09:51:53,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 09:51:53,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 09:51:53,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 09:51:53,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 09:51:53,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 09:51:53,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 09:51:53,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 09:51:53,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 09:51:53,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 09:51:53,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 09:51:53,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Bitvector.epf [2019-11-22 09:51:53,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 09:51:53,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 09:51:53,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 09:51:53,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 09:51:53,427 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 09:51:53,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 09:51:53,428 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 09:51:53,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 09:51:53,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 09:51:53,429 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 09:51:53,429 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 09:51:53,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 09:51:53,429 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 09:51:53,430 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 09:51:53,430 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 09:51:53,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 09:51:53,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 09:51:53,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 09:51:53,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 09:51:53,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 09:51:53,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:51:53,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 09:51:53,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 09:51:53,433 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 09:51:53,433 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 09:51:53,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 09:51:53,433 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-22 09:51:53,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 09:51:53,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 09:51:53,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 09:51:53,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 09:51:53,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 09:51:53,767 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 09:51:53,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a6b80d9/fa82e719dec84e6e898ea653f9a06e28/FLAG409675701 [2019-11-22 09:51:54,376 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 09:51:54,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-22 09:51:54,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a6b80d9/fa82e719dec84e6e898ea653f9a06e28/FLAG409675701 [2019-11-22 09:51:54,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a6b80d9/fa82e719dec84e6e898ea653f9a06e28 [2019-11-22 09:51:54,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 09:51:54,665 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 09:51:54,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 09:51:54,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 09:51:54,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 09:51:54,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:51:54" (1/1) ... [2019-11-22 09:51:54,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad6c7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:54, skipping insertion in model container [2019-11-22 09:51:54,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:51:54" (1/1) ... [2019-11-22 09:51:54,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 09:51:54,738 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:51:55,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:51:55,282 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 09:51:55,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:51:55,398 INFO L205 MainTranslator]: Completed translation [2019-11-22 09:51:55,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55 WrapperNode [2019-11-22 09:51:55,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 09:51:55,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 09:51:55,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 09:51:55,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 09:51:55,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (1/1) ... [2019-11-22 09:51:55,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (1/1) ... [2019-11-22 09:51:55,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (1/1) ... [2019-11-22 09:51:55,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (1/1) ... [2019-11-22 09:51:55,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (1/1) ... [2019-11-22 09:51:55,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (1/1) ... [2019-11-22 09:51:55,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (1/1) ... [2019-11-22 09:51:55,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 09:51:55,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 09:51:55,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 09:51:55,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 09:51:55,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:51:55,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 09:51:55,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 09:51:55,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:51:55,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 09:51:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 09:51:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-22 09:51:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-22 09:51:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-22 09:51:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-22 09:51:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 09:51:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 09:51:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 09:51:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 09:51:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 09:51:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 09:51:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 09:51:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 09:51:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 09:51:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 09:51:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 09:51:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 09:51:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 09:51:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 09:51:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 09:51:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 09:51:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 09:51:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 09:51:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 09:51:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 09:51:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 09:51:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-22 09:51:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-22 09:51:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-22 09:51:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 09:51:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 09:51:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 09:51:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 09:51:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 09:51:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 09:51:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 09:51:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 09:51:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 09:51:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 09:51:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 09:51:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 09:51:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 09:51:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 09:51:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 09:51:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 09:51:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 09:51:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 09:51:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 09:51:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 09:51:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 09:51:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 09:51:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 09:51:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 09:51:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 09:51:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 09:51:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 09:51:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 09:51:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 09:51:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 09:51:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 09:51:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 09:51:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 09:51:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 09:51:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 09:51:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 09:51:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 09:51:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 09:51:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 09:51:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 09:51:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 09:51:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 09:51:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 09:51:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 09:51:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 09:51:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 09:51:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 09:51:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 09:51:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 09:51:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 09:51:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 09:51:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 09:51:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 09:51:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 09:51:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 09:51:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 09:51:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 09:51:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 09:51:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 09:51:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 09:51:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 09:51:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 09:51:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 09:51:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 09:51:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 09:51:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 09:51:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 09:51:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 09:51:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 09:51:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 09:51:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 09:51:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 09:51:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 09:51:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 09:51:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 09:51:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 09:51:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 09:51:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 09:51:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 09:51:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 09:51:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 09:51:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 09:51:55,579 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 09:51:55,579 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 09:51:55,579 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 09:51:55,579 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 09:51:55,579 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-22 09:51:55,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 09:51:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 09:51:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 09:51:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 09:51:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 09:51:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 09:51:55,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 09:51:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 09:51:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 09:51:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:51:55,967 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-22 09:51:56,364 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 09:51:56,365 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 09:51:56,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:51:56 BoogieIcfgContainer [2019-11-22 09:51:56,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 09:51:56,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 09:51:56,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 09:51:56,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 09:51:56,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:51:54" (1/3) ... [2019-11-22 09:51:56,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aac3848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:51:56, skipping insertion in model container [2019-11-22 09:51:56,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:55" (2/3) ... [2019-11-22 09:51:56,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aac3848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:51:56, skipping insertion in model container [2019-11-22 09:51:56,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:51:56" (3/3) ... [2019-11-22 09:51:56,374 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-ext.i [2019-11-22 09:51:56,384 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 09:51:56,392 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 09:51:56,404 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 09:51:56,425 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 09:51:56,425 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 09:51:56,426 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 09:51:56,426 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 09:51:56,426 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 09:51:56,427 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 09:51:56,427 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 09:51:56,427 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 09:51:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-22 09:51:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:51:56,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:51:56,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:51:56,456 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 09:51:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:51:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash 56539660, now seen corresponding path program 1 times [2019-11-22 09:51:56,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:51:56,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [639542609] [2019-11-22 09:51:56,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:51:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:51:56,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:51:56,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:51:56,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:51:56,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:51:56,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:51:56,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:51:56,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 09:51:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:51:56,797 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:51:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:51:56,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639542609] [2019-11-22 09:51:56,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:51:56,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:51:56,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696000604] [2019-11-22 09:51:56,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:51:56,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:51:56,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:51:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:51:56,839 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2019-11-22 09:51:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:51:57,150 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-11-22 09:51:57,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:51:57,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 09:51:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:51:57,162 INFO L225 Difference]: With dead ends: 77 [2019-11-22 09:51:57,162 INFO L226 Difference]: Without dead ends: 68 [2019-11-22 09:51:57,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:51:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-22 09:51:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2019-11-22 09:51:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 09:51:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-22 09:51:57,212 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 10 [2019-11-22 09:51:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:51:57,213 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-22 09:51:57,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:51:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-22 09:51:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:51:57,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:51:57,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:51:57,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:51:57,418 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 09:51:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:51:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash 56539661, now seen corresponding path program 1 times [2019-11-22 09:51:57,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:51:57,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [437931408] [2019-11-22 09:51:57,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:51:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:51:57,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 09:51:57,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:51:57,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:51:57,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:51:57,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:51:57,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:51:57,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:51:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:51:57,668 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:51:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:51:57,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [437931408] [2019-11-22 09:51:57,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:51:57,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 09:51:57,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252962930] [2019-11-22 09:51:57,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 09:51:57,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:51:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 09:51:57,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 09:51:57,769 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 6 states. [2019-11-22 09:51:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:51:58,212 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-22 09:51:58,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:51:58,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-22 09:51:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:51:58,214 INFO L225 Difference]: With dead ends: 73 [2019-11-22 09:51:58,214 INFO L226 Difference]: Without dead ends: 73 [2019-11-22 09:51:58,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:51:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-22 09:51:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2019-11-22 09:51:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 09:51:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-22 09:51:58,223 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 10 [2019-11-22 09:51:58,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:51:58,224 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-22 09:51:58,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 09:51:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-22 09:51:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 09:51:58,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:51:58,225 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 09:51:58,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:51:58,431 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 09:51:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:51:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1628877614, now seen corresponding path program 1 times [2019-11-22 09:51:58,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:51:58,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1408988300] [2019-11-22 09:51:58,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:51:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:51:58,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:51:58,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:51:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:51:58,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:51:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:51:58,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1408988300] [2019-11-22 09:51:58,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:51:58,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 09:51:58,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272249604] [2019-11-22 09:51:58,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:51:58,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:51:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:51:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:51:58,679 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 4 states. [2019-11-22 09:51:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:51:58,899 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-22 09:51:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:51:58,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-22 09:51:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:51:58,902 INFO L225 Difference]: With dead ends: 69 [2019-11-22 09:51:58,902 INFO L226 Difference]: Without dead ends: 69 [2019-11-22 09:51:58,903 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 09:51:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-22 09:51:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-22 09:51:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 09:51:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-11-22 09:51:58,911 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 17 [2019-11-22 09:51:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:51:58,912 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-11-22 09:51:58,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:51:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-11-22 09:51:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 09:51:58,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:51:58,913 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 09:51:59,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:51:59,116 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 09:51:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:51:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash -888671678, now seen corresponding path program 1 times [2019-11-22 09:51:59,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:51:59,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [776402426] [2019-11-22 09:51:59,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:51:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:51:59,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 09:51:59,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:51:59,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:51:59,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-22 09:51:59,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:51:59,385 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-22 09:51:59,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:51:59,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 09:51:59,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:51:59,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:51:59,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:51:59,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:51:59,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-22 09:51:59,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-22 09:51:59,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:51:59,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:51:59,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:51:59,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-22 09:51:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:51:59,488 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:51:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:51:59,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [776402426] [2019-11-22 09:51:59,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:51:59,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-22 09:51:59,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949779838] [2019-11-22 09:51:59,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:51:59,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:51:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:51:59,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:51:59,528 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 8 states. [2019-11-22 09:52:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:00,151 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-11-22 09:52:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 09:52:00,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-22 09:52:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:00,153 INFO L225 Difference]: With dead ends: 82 [2019-11-22 09:52:00,153 INFO L226 Difference]: Without dead ends: 82 [2019-11-22 09:52:00,154 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 09:52:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-22 09:52:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2019-11-22 09:52:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 09:52:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-22 09:52:00,169 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2019-11-22 09:52:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:00,169 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-22 09:52:00,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:52:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-22 09:52:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 09:52:00,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:00,171 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 09:52:00,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:00,382 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 09:52:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash -888671677, now seen corresponding path program 1 times [2019-11-22 09:52:00,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:00,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1449976239] [2019-11-22 09:52:00,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:00,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 09:52:00,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:00,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:52:00,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:00,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:00,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:00,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:52:00,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:52:00,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:00,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:00,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:52:00,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:00,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:00,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:00,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-22 09:52:00,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-22 09:52:00,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:00,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:00,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-22 09:52:00,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:00,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:00,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:00,763 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:11 [2019-11-22 09:52:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:00,794 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:52:01,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1449976239] [2019-11-22 09:52:01,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:52:01,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:52:01,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220763249] [2019-11-22 09:52:01,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:52:01,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:01,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:52:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:52:01,007 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 10 states. [2019-11-22 09:52:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:02,346 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-11-22 09:52:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 09:52:02,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-22 09:52:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:02,348 INFO L225 Difference]: With dead ends: 88 [2019-11-22 09:52:02,348 INFO L226 Difference]: Without dead ends: 88 [2019-11-22 09:52:02,349 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 09:52:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-22 09:52:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 48. [2019-11-22 09:52:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-22 09:52:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-11-22 09:52:02,355 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2019-11-22 09:52:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:02,355 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-11-22 09:52:02,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:52:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-11-22 09:52:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:52:02,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:02,356 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 09:52:02,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:02,558 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 09:52:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash -739303751, now seen corresponding path program 1 times [2019-11-22 09:52:02,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:02,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [84777254] [2019-11-22 09:52:02,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:02,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 09:52:02,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:02,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:52:02,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:02,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:02,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:52:02,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:02,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:02,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:02,821 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-22 09:52:02,863 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 09:52:02,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:02,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:02,878 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 09:52:02,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:02,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:02,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:02,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-22 09:52:02,908 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 09:52:02,908 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:02,985 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 09:52:02,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 09:52:03,000 INFO L567 ElimStorePlain]: treesize reduction 19, result has 36.7 percent of original size [2019-11-22 09:52:03,001 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-22 09:52:03,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-22 09:52:03,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2019-11-22 09:52:03,026 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 09:52:03,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [84777254] [2019-11-22 09:52:03,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:52:03,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-11-22 09:52:03,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573735264] [2019-11-22 09:52:03,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 09:52:03,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:03,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 09:52:03,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-22 09:52:03,028 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 11 states. [2019-11-22 09:52:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:03,624 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-11-22 09:52:03,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 09:52:03,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-22 09:52:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:03,626 INFO L225 Difference]: With dead ends: 89 [2019-11-22 09:52:03,626 INFO L226 Difference]: Without dead ends: 89 [2019-11-22 09:52:03,627 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 09:52:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-22 09:52:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 58. [2019-11-22 09:52:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-22 09:52:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-11-22 09:52:03,634 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2019-11-22 09:52:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:03,634 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-11-22 09:52:03,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 09:52:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-11-22 09:52:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 09:52:03,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:03,636 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 09:52:03,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:03,839 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 09:52:03,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1885491277, now seen corresponding path program 1 times [2019-11-22 09:52:03,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:03,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1991187759] [2019-11-22 09:52:03,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:04,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:52:04,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:04,019 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 09:52:04,019 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:04,026 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 09:52:04,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1991187759] [2019-11-22 09:52:04,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:52:04,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:52:04,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239213831] [2019-11-22 09:52:04,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:52:04,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:04,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:52:04,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:52:04,028 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 4 states. [2019-11-22 09:52:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:04,197 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-22 09:52:04,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:52:04,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 09:52:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:04,200 INFO L225 Difference]: With dead ends: 66 [2019-11-22 09:52:04,200 INFO L226 Difference]: Without dead ends: 66 [2019-11-22 09:52:04,200 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 09:52:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-22 09:52:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2019-11-22 09:52:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-22 09:52:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-11-22 09:52:04,206 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 24 [2019-11-22 09:52:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:04,206 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-11-22 09:52:04,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:52:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-11-22 09:52:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 09:52:04,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:04,207 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 09:52:04,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:04,411 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 09:52:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 849527619, now seen corresponding path program 1 times [2019-11-22 09:52:04,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:04,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [834786066] [2019-11-22 09:52:04,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:04,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 09:52:04,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:04,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:52:04,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:04,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:04,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:04,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:52:04,780 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:04,781 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 09:52:04,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:04,829 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-22 09:52:04,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:04,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-22 09:52:04,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:52:04,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:04,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:04,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:04,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-22 09:52:13,127 WARN L192 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-22 09:52:13,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:13,128 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 09:52:13,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:13,172 INFO L567 ElimStorePlain]: treesize reduction 34, result has 44.3 percent of original size [2019-11-22 09:52:13,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:13,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:27 [2019-11-22 09:52:13,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:13,237 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 09:52:13,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:13,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:13,307 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.6 percent of original size [2019-11-22 09:52:13,308 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 09:52:13,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2019-11-22 09:52:13,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:13,430 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 09:52:13,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:13,457 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-22 09:52:13,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:52:13,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:17 [2019-11-22 09:52:13,524 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 09:52:13,524 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:13,673 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:52:13,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:13,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:52:13,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:26 [2019-11-22 09:52:15,261 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 09:52:15,263 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:52:15,590 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-22 09:52:15,592 INFO L567 ElimStorePlain]: treesize reduction 66, result has 71.3 percent of original size [2019-11-22 09:52:15,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,687 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 09:52:15,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:1138 [2019-11-22 09:52:15,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:16,022 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 27 [2019-11-22 09:52:16,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:16,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:16,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:18,394 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-11-22 09:52:18,418 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 09:52:18,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [834786066] [2019-11-22 09:52:18,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:52:18,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-11-22 09:52:18,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390612986] [2019-11-22 09:52:18,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 09:52:18,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:18,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 09:52:18,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=420, Unknown=1, NotChecked=0, Total=506 [2019-11-22 09:52:18,421 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 23 states. [2019-11-22 09:52:35,203 WARN L192 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-11-22 09:52:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:35,787 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2019-11-22 09:52:35,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-22 09:52:35,788 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-11-22 09:52:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:35,789 INFO L225 Difference]: With dead ends: 117 [2019-11-22 09:52:35,789 INFO L226 Difference]: Without dead ends: 117 [2019-11-22 09:52:35,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=277, Invalid=1128, Unknown=1, NotChecked=0, Total=1406 [2019-11-22 09:52:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-22 09:52:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 76. [2019-11-22 09:52:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-22 09:52:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-11-22 09:52:35,801 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 26 [2019-11-22 09:52:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:35,801 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-11-22 09:52:35,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 09:52:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-11-22 09:52:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 09:52:35,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:52:35,806 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 09:52:36,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:36,011 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 09:52:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:52:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash 849527620, now seen corresponding path program 1 times [2019-11-22 09:52:36,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:52:36,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [242570017] [2019-11-22 09:52:36,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:52:36,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 09:52:36,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:52:36,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:52:36,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:52:36,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 09:52:36,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-22 09:52:36,383 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 09:52:36,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-22 09:52:36,419 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_25|]} [2019-11-22 09:52:36,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:52:36,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:52:36,463 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 09:52:36,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,483 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-11-22 09:52:36,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 09:52:36,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-11-22 09:52:36,566 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 09:52:36,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2019-11-22 09:52:36,586 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 09:52:36,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2019-11-22 09:52:36,659 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 09:52:36,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:52:36,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-22 09:52:36,697 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 09:52:36,697 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:52:36,775 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:52:36,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:36,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:52:36,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-22 09:52:37,142 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:52:37,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:52:37,155 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 09:52:37,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2019-11-22 09:52:46,064 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 09:52:46,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 09:52:47,244 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 159 DAG size of output: 53 [2019-11-22 09:52:47,245 INFO L567 ElimStorePlain]: treesize reduction 3016, result has 3.2 percent of original size [2019-11-22 09:52:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:52:47,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:47,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:47,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:47,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:47,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:47,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:47,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:52:47,269 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 09:52:47,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:59 [2019-11-22 09:52:47,737 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 09:52:47,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [242570017] [2019-11-22 09:52:47,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:52:47,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-11-22 09:52:47,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247747236] [2019-11-22 09:52:47,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 09:52:47,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:52:47,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 09:52:47,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=416, Unknown=4, NotChecked=0, Total=506 [2019-11-22 09:52:47,740 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 23 states. [2019-11-22 09:52:49,252 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-11-22 09:52:49,536 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-11-22 09:52:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:52:49,586 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-11-22 09:52:49,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 09:52:49,588 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-11-22 09:52:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:52:49,588 INFO L225 Difference]: With dead ends: 41 [2019-11-22 09:52:49,589 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 09:52:49,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=232, Invalid=756, Unknown=4, NotChecked=0, Total=992 [2019-11-22 09:52:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 09:52:49,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 09:52:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 09:52:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 09:52:49,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-22 09:52:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:52:49,591 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 09:52:49,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 09:52:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 09:52:49,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 09:52:49,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:52:49,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:52:49 BoogieIcfgContainer [2019-11-22 09:52:49,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 09:52:49,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 09:52:49,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 09:52:49,800 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 09:52:49,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:51:56" (3/4) ... [2019-11-22 09:52:49,804 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 09:52:49,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:52:49,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 09:52:49,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-22 09:52:49,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 09:52:49,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 09:52:49,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-22 09:52:49,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-22 09:52:49,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 09:52:49,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-22 09:52:49,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-22 09:52:49,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-22 09:52:49,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 09:52:49,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 09:52:49,863 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 09:52:49,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 09:52:49,865 INFO L168 Benchmark]: Toolchain (without parser) took 55200.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -246.7 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. [2019-11-22 09:52:49,865 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:52:49,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-22 09:52:49,866 INFO L168 Benchmark]: Boogie Preprocessor took 100.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-22 09:52:49,866 INFO L168 Benchmark]: RCFGBuilder took 866.49 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: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-11-22 09:52:49,867 INFO L168 Benchmark]: TraceAbstraction took 53432.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-11-22 09:52:49,867 INFO L168 Benchmark]: Witness Printer took 63.24 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 09:52:49,869 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 733.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 866.49 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: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53432.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Witness Printer took 63.24 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: 53.3s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 22.9s, 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, 25.9s 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.5s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 314 ConstructedInterpolants, 27 QuantifiedInterpolants, 59287 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...