./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 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/memsafety-ext2/complex_data_creation_test02-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9d66dda134cf3fa8347acab6e82f659b1de366bb --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 11:06:34,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 11:06:34,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 11:06:34,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 11:06:34,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 11:06:34,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 11:06:34,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 11:06:34,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 11:06:34,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 11:06:34,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 11:06:34,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 11:06:34,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 11:06:34,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 11:06:34,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 11:06:34,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 11:06:34,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 11:06:34,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 11:06:34,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 11:06:34,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 11:06:34,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 11:06:34,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 11:06:34,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 11:06:34,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 11:06:34,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 11:06:34,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 11:06:34,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 11:06:34,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 11:06:34,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 11:06:34,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 11:06:34,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 11:06:34,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 11:06:34,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 11:06:34,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 11:06:34,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 11:06:34,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 11:06:34,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 11:06:34,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 11:06:34,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 11:06:34,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 11:06:34,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 11:06:34,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 11:06:34,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 11:06:34,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 11:06:34,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 11:06:34,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 11:06:34,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 11:06:34,432 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 11:06:34,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 11:06:34,432 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 11:06:34,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 11:06:34,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 11:06:34,433 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 11:06:34,433 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 11:06:34,434 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 11:06:34,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 11:06:34,434 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 11:06:34,434 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 11:06:34,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 11:06:34,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 11:06:34,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 11:06:34,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 11:06:34,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 11:06:34,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:06:34,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 11:06:34,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 11:06:34,437 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 11:06:34,438 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 11:06:34,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 11:06:34,438 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d66dda134cf3fa8347acab6e82f659b1de366bb Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 11:06:34,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 11:06:34,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 11:06:34,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 11:06:34,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 11:06:34,828 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 11:06:34,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2019-11-21 11:06:34,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcf7237f/0a7c2e3254c840ce80ee6b05505dc703/FLAG597721595 [2019-11-21 11:06:35,419 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 11:06:35,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2019-11-21 11:06:35,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcf7237f/0a7c2e3254c840ce80ee6b05505dc703/FLAG597721595 [2019-11-21 11:06:35,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcf7237f/0a7c2e3254c840ce80ee6b05505dc703 [2019-11-21 11:06:35,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 11:06:35,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 11:06:35,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 11:06:35,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 11:06:35,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 11:06:35,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:06:35" (1/1) ... [2019-11-21 11:06:35,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f25c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:35, skipping insertion in model container [2019-11-21 11:06:35,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:06:35" (1/1) ... [2019-11-21 11:06:35,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 11:06:35,820 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:06:36,265 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 11:06:36,266 INFO L969 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [545] [2019-11-21 11:06:36,266 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:06:36,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:06:36,314 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 11:06:36,322 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:06:36,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:06:36,371 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 11:06:36,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:06:36,496 INFO L205 MainTranslator]: Completed translation [2019-11-21 11:06:36,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36 WrapperNode [2019-11-21 11:06:36,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 11:06:36,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 11:06:36,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 11:06:36,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 11:06:36,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (1/1) ... [2019-11-21 11:06:36,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (1/1) ... [2019-11-21 11:06:36,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (1/1) ... [2019-11-21 11:06:36,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (1/1) ... [2019-11-21 11:06:36,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (1/1) ... [2019-11-21 11:06:36,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (1/1) ... [2019-11-21 11:06:36,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (1/1) ... [2019-11-21 11:06:36,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 11:06:36,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 11:06:36,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 11:06:36,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 11:06:36,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (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-21 11:06:36,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 11:06:36,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 11:06:36,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 11:06:36,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 11:06:36,664 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 11:06:36,664 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 11:06:36,664 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 11:06:36,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 11:06:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 11:06:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 11:06:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 11:06:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 11:06:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 11:06:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 11:06:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 11:06:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 11:06:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 11:06:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 11:06:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 11:06:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 11:06:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 11:06:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 11:06:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 11:06:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 11:06:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 11:06:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 11:06:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 11:06:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 11:06:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 11:06:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 11:06:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 11:06:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 11:06:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 11:06:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 11:06:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 11:06:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 11:06:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 11:06:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 11:06:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 11:06:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 11:06:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 11:06:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 11:06:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 11:06:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 11:06:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 11:06:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 11:06:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 11:06:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 11:06:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 11:06:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 11:06:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 11:06:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 11:06:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 11:06:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 11:06:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 11:06:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 11:06:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 11:06:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 11:06:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 11:06:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 11:06:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 11:06:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 11:06:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 11:06:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 11:06:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 11:06:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 11:06:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 11:06:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 11:06:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 11:06:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 11:06:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 11:06:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 11:06:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 11:06:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 11:06:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 11:06:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 11:06:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 11:06:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 11:06:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 11:06:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 11:06:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 11:06:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 11:06:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 11:06:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 11:06:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 11:06:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 11:06:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 11:06:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 11:06:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 11:06:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 11:06:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 11:06:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 11:06:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 11:06:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 11:06:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 11:06:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 11:06:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 11:06:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 11:06:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 11:06:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 11:06:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 11:06:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 11:06:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 11:06:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 11:06:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 11:06:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 11:06:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 11:06:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 11:06:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 11:06:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 11:06:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 11:06:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 11:06:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 11:06:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 11:06:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 11:06:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 11:06:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 11:06:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 11:06:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 11:06:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 11:06:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 11:06:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 11:06:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 11:06:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 11:06:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 11:06:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 11:06:36,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 11:06:36,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 11:06:36,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 11:06:38,018 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 11:06:38,019 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-21 11:06:38,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:06:38 BoogieIcfgContainer [2019-11-21 11:06:38,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 11:06:38,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 11:06:38,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 11:06:38,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 11:06:38,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:06:35" (1/3) ... [2019-11-21 11:06:38,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3411c7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:06:38, skipping insertion in model container [2019-11-21 11:06:38,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:06:36" (2/3) ... [2019-11-21 11:06:38,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3411c7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:06:38, skipping insertion in model container [2019-11-21 11:06:38,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:06:38" (3/3) ... [2019-11-21 11:06:38,029 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-1.i [2019-11-21 11:06:38,039 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 11:06:38,048 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-21 11:06:38,061 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-21 11:06:38,083 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 11:06:38,083 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 11:06:38,083 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 11:06:38,083 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 11:06:38,084 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 11:06:38,084 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 11:06:38,084 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 11:06:38,084 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 11:06:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states. [2019-11-21 11:06:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 11:06:38,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:38,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:38,120 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:38,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:38,126 INFO L82 PathProgramCache]: Analyzing trace with hash -243394811, now seen corresponding path program 1 times [2019-11-21 11:06:38,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:38,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2089064596] [2019-11-21 11:06:38,140 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-21 11:06:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:38,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 11:06:38,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:38,386 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-21 11:06:38,387 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:38,406 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-21 11:06:38,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2089064596] [2019-11-21 11:06:38,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:38,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 11:06:38,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974785100] [2019-11-21 11:06:38,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 11:06:38,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:38,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 11:06:38,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 11:06:38,434 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 2 states. [2019-11-21 11:06:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:06:38,468 INFO L93 Difference]: Finished difference Result 200 states and 211 transitions. [2019-11-21 11:06:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 11:06:38,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 11:06:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:06:38,483 INFO L225 Difference]: With dead ends: 200 [2019-11-21 11:06:38,484 INFO L226 Difference]: Without dead ends: 197 [2019-11-21 11:06:38,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 11:06:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-21 11:06:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-11-21 11:06:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-21 11:06:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 208 transitions. [2019-11-21 11:06:38,546 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 208 transitions. Word has length 8 [2019-11-21 11:06:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:06:38,547 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 208 transitions. [2019-11-21 11:06:38,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 11:06:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 208 transitions. [2019-11-21 11:06:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 11:06:38,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:38,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:38,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:06:38,752 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:38,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1044781659, now seen corresponding path program 1 times [2019-11-21 11:06:38,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:38,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [84031121] [2019-11-21 11:06:38,754 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-21 11:06:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:38,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 11:06:38,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:39,031 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-21 11:06:39,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:39,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:39,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:06:39,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:06:39,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:39,125 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 19 treesize of output 41 [2019-11-21 11:06:39,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:39,165 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 11:06:39,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:06:39,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 11:06:39,197 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-21 11:06:39,198 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:39,288 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-21 11:06:39,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [84031121] [2019-11-21 11:06:39,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:39,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 11:06:39,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635770001] [2019-11-21 11:06:39,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 11:06:39,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:39,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 11:06:39,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 11:06:39,296 INFO L87 Difference]: Start difference. First operand 197 states and 208 transitions. Second operand 8 states. [2019-11-21 11:06:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:06:40,722 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2019-11-21 11:06:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:06:40,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 11:06:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:06:40,726 INFO L225 Difference]: With dead ends: 191 [2019-11-21 11:06:40,726 INFO L226 Difference]: Without dead ends: 191 [2019-11-21 11:06:40,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-21 11:06:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-21 11:06:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-11-21 11:06:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-21 11:06:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2019-11-21 11:06:40,742 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 9 [2019-11-21 11:06:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:06:40,742 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2019-11-21 11:06:40,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 11:06:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2019-11-21 11:06:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 11:06:40,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:40,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:40,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:06:40,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1044781660, now seen corresponding path program 1 times [2019-11-21 11:06:40,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:40,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1977050464] [2019-11-21 11:06:40,949 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-21 11:06:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:41,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 11:06:41,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:41,180 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-21 11:06:41,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:41,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:41,201 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-21 11:06:41,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:41,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:41,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:06:41,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 11:06:41,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:06:41,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-21 11:06:41,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:41,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:41,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:06:41,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 11:06:41,306 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:41,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:41,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:06:41,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2019-11-21 11:06:41,352 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-21 11:06:41,352 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:41,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:06:41,600 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-21 11:06:41,771 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-21 11:06:41,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1977050464] [2019-11-21 11:06:41,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:41,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 11:06:41,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001864991] [2019-11-21 11:06:41,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 11:06:41,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:41,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 11:06:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 11:06:41,775 INFO L87 Difference]: Start difference. First operand 191 states and 202 transitions. Second operand 8 states. [2019-11-21 11:06:43,473 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-21 11:06:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:06:48,936 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2019-11-21 11:06:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 11:06:48,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 11:06:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:06:48,944 INFO L225 Difference]: With dead ends: 206 [2019-11-21 11:06:48,944 INFO L226 Difference]: Without dead ends: 206 [2019-11-21 11:06:48,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:06:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-21 11:06:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-11-21 11:06:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-21 11:06:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2019-11-21 11:06:48,962 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 9 [2019-11-21 11:06:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:06:48,962 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2019-11-21 11:06:48,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 11:06:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2019-11-21 11:06:48,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 11:06:48,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:48,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:49,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:06:49,166 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1971506722, now seen corresponding path program 1 times [2019-11-21 11:06:49,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:49,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1120782222] [2019-11-21 11:06:49,169 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-21 11:06:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:49,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 11:06:49,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:49,358 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-21 11:06:49,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:49,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:49,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:06:49,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:06:49,371 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-21 11:06:49,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:49,392 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-21 11:06:49,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1120782222] [2019-11-21 11:06:49,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:49,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 11:06:49,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926738120] [2019-11-21 11:06:49,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:06:49,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:49,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:06:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:06:49,394 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand 4 states. [2019-11-21 11:06:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:06:49,818 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2019-11-21 11:06:49,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:06:49,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 11:06:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:06:49,821 INFO L225 Difference]: With dead ends: 187 [2019-11-21 11:06:49,821 INFO L226 Difference]: Without dead ends: 187 [2019-11-21 11:06:49,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:06:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-21 11:06:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-11-21 11:06:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-21 11:06:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2019-11-21 11:06:49,835 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 10 [2019-11-21 11:06:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:06:49,835 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2019-11-21 11:06:49,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:06:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2019-11-21 11:06:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 11:06:49,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:49,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:50,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:06:50,040 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1971506721, now seen corresponding path program 1 times [2019-11-21 11:06:50,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:50,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1848121569] [2019-11-21 11:06:50,042 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-21 11:06:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:50,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:06:50,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:50,240 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-21 11:06:50,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:50,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:50,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:06:50,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:06:50,253 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-21 11:06:50,253 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:50,281 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-21 11:06:50,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1848121569] [2019-11-21 11:06:50,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:50,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 11:06:50,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003930059] [2019-11-21 11:06:50,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:06:50,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:06:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:06:50,283 INFO L87 Difference]: Start difference. First operand 187 states and 198 transitions. Second operand 4 states. [2019-11-21 11:06:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:06:50,861 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2019-11-21 11:06:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:06:50,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 11:06:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:06:50,863 INFO L225 Difference]: With dead ends: 185 [2019-11-21 11:06:50,863 INFO L226 Difference]: Without dead ends: 185 [2019-11-21 11:06:50,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:06:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-21 11:06:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-11-21 11:06:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-21 11:06:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2019-11-21 11:06:50,873 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 10 [2019-11-21 11:06:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:06:50,874 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2019-11-21 11:06:50,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:06:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2019-11-21 11:06:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 11:06:50,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:50,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:51,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:06:51,078 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1603176019, now seen corresponding path program 1 times [2019-11-21 11:06:51,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:51,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1927762938] [2019-11-21 11:06:51,079 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-21 11:06:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:51,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-21 11:06:51,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:51,295 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-21 11:06:51,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:51,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-11-21 11:06:51,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:51,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 11:06:51,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:51,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2019-11-21 11:06:51,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 11:06:51,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:51,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 11:06:51,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:51,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:18 [2019-11-21 11:06:51,536 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-21 11:06:51,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:51,546 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-21 11:06:51,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:51,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:51,551 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-21 11:06:51,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-21 11:06:51,567 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-21 11:06:51,567 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:51,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:06:54,782 WARN L192 SmtUtils]: Spent 997.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 11:06:54,981 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-21 11:06:54,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1927762938] [2019-11-21 11:06:54,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:54,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-21 11:06:54,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119540143] [2019-11-21 11:06:54,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 11:06:54,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 11:06:54,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:06:54,984 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 11 states. [2019-11-21 11:06:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:06:57,509 INFO L93 Difference]: Finished difference Result 193 states and 206 transitions. [2019-11-21 11:06:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 11:06:57,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-21 11:06:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:06:57,514 INFO L225 Difference]: With dead ends: 193 [2019-11-21 11:06:57,515 INFO L226 Difference]: Without dead ends: 193 [2019-11-21 11:06:57,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-21 11:06:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-21 11:06:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-11-21 11:06:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-21 11:06:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2019-11-21 11:06:57,546 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 15 [2019-11-21 11:06:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:06:57,546 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2019-11-21 11:06:57,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 11:06:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2019-11-21 11:06:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 11:06:57,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:57,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:57,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:06:57,753 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:57,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1235118745, now seen corresponding path program 1 times [2019-11-21 11:06:57,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:57,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2107443751] [2019-11-21 11:06:57,759 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-21 11:06:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:57,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 11:06:57,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:58,010 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-21 11:06:58,010 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:58,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:06:58,017 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-21 11:06:58,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2107443751] [2019-11-21 11:06:58,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:58,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:06:58,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615815852] [2019-11-21 11:06:58,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:06:58,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:06:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:06:58,019 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand 4 states. [2019-11-21 11:06:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:06:58,073 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2019-11-21 11:06:58,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:06:58,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-21 11:06:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:06:58,075 INFO L225 Difference]: With dead ends: 270 [2019-11-21 11:06:58,075 INFO L226 Difference]: Without dead ends: 270 [2019-11-21 11:06:58,075 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-21 11:06:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-21 11:06:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 234. [2019-11-21 11:06:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-21 11:06:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 286 transitions. [2019-11-21 11:06:58,084 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 286 transitions. Word has length 17 [2019-11-21 11:06:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:06:58,084 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 286 transitions. [2019-11-21 11:06:58,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:06:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 286 transitions. [2019-11-21 11:06:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 11:06:58,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:58,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:58,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:06:58,288 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash -366018359, now seen corresponding path program 1 times [2019-11-21 11:06:58,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:58,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1808172817] [2019-11-21 11:06:58,291 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-21 11:06:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:58,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 11:06:58,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:58,543 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:06:58,544 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 11:06:58,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:58,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:58,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:06:58,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-21 11:06:58,561 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-21 11:06:58,562 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:58,568 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-21 11:06:58,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1808172817] [2019-11-21 11:06:58,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:58,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 11:06:58,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294804602] [2019-11-21 11:06:58,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 11:06:58,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:58,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 11:06:58,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 11:06:58,570 INFO L87 Difference]: Start difference. First operand 234 states and 286 transitions. Second operand 3 states. [2019-11-21 11:06:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:06:58,968 INFO L93 Difference]: Finished difference Result 237 states and 282 transitions. [2019-11-21 11:06:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:06:58,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-21 11:06:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:06:58,971 INFO L225 Difference]: With dead ends: 237 [2019-11-21 11:06:58,971 INFO L226 Difference]: Without dead ends: 237 [2019-11-21 11:06:58,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 11:06:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-21 11:06:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228. [2019-11-21 11:06:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-21 11:06:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 276 transitions. [2019-11-21 11:06:58,979 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 276 transitions. Word has length 18 [2019-11-21 11:06:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:06:58,980 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 276 transitions. [2019-11-21 11:06:58,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 11:06:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 276 transitions. [2019-11-21 11:06:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 11:06:58,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:06:58,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:06:59,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:06:59,184 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:06:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:06:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash -366018358, now seen corresponding path program 1 times [2019-11-21 11:06:59,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:06:59,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1476011481] [2019-11-21 11:06:59,186 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-21 11:06:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:06:59,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 11:06:59,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:06:59,436 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_112|], 1=[|v_#valid_160|]} [2019-11-21 11:06:59,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:06:59,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 11:06:59,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:59,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:59,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:06:59,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 11:06:59,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:06:59,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:06:59,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:06:59,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-21 11:06:59,479 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-21 11:06:59,480 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:06:59,528 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-21 11:06:59,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1476011481] [2019-11-21 11:06:59,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:06:59,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 11:06:59,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018553247] [2019-11-21 11:06:59,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:06:59,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:06:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:06:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:06:59,530 INFO L87 Difference]: Start difference. First operand 228 states and 276 transitions. Second operand 4 states. [2019-11-21 11:07:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:07:00,552 INFO L93 Difference]: Finished difference Result 253 states and 298 transitions. [2019-11-21 11:07:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 11:07:00,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 11:07:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:07:00,555 INFO L225 Difference]: With dead ends: 253 [2019-11-21 11:07:00,556 INFO L226 Difference]: Without dead ends: 253 [2019-11-21 11:07:00,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:07:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-21 11:07:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 219. [2019-11-21 11:07:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-21 11:07:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 258 transitions. [2019-11-21 11:07:00,567 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 258 transitions. Word has length 18 [2019-11-21 11:07:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:07:00,567 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 258 transitions. [2019-11-21 11:07:00,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:07:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2019-11-21 11:07:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:07:00,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:07:00,568 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] [2019-11-21 11:07:00,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:07:00,772 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:07:00,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:07:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1170583220, now seen corresponding path program 1 times [2019-11-21 11:07:00,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:07:00,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2118158699] [2019-11-21 11:07:00,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:07:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:07:00,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:07:00,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:07:01,011 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:07:01,012 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 11:07:01,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:01,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:01,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:07:01,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-21 11:07:01,039 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-21 11:07:01,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:01,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:01,048 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-21 11:07:01,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-21 11:07:01,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 21 treesize of output 9 [2019-11-21 11:07:01,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:01,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:01,067 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-21 11:07:01,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-21 11:07:01,074 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-21 11:07:01,074 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:07:01,087 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-21 11:07:01,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2118158699] [2019-11-21 11:07:01,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:07:01,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:07:01,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367083959] [2019-11-21 11:07:01,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:07:01,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:07:01,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:07:01,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:07:01,090 INFO L87 Difference]: Start difference. First operand 219 states and 258 transitions. Second operand 5 states. [2019-11-21 11:07:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:07:01,832 INFO L93 Difference]: Finished difference Result 228 states and 264 transitions. [2019-11-21 11:07:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:07:01,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 11:07:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:07:01,836 INFO L225 Difference]: With dead ends: 228 [2019-11-21 11:07:01,836 INFO L226 Difference]: Without dead ends: 228 [2019-11-21 11:07:01,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-21 11:07:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-21 11:07:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 218. [2019-11-21 11:07:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-21 11:07:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 256 transitions. [2019-11-21 11:07:01,844 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 256 transitions. Word has length 22 [2019-11-21 11:07:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:07:01,844 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 256 transitions. [2019-11-21 11:07:01,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:07:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 256 transitions. [2019-11-21 11:07:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:07:01,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:07:01,845 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] [2019-11-21 11:07:02,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:07:02,050 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:07:02,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:07:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1170583221, now seen corresponding path program 1 times [2019-11-21 11:07:02,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:07:02,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [737021660] [2019-11-21 11:07:02,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:07:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:07:02,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 11:07:02,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:07:02,305 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:02,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 11:07:02,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:02,333 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-21 11:07:02,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:07:02,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-21 11:07:02,354 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-21 11:07:02,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:02,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:02,381 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-21 11:07:02,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:02,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:02,394 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-21 11:07:02,394 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-11-21 11:07:02,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-21 11:07:02,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:02,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:02,475 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-21 11:07:02,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:02,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:02,485 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-21 11:07:02,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-21 11:07:02,502 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-21 11:07:02,503 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:07:02,931 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-21 11:07:02,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [737021660] [2019-11-21 11:07:02,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:07:02,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 11:07:02,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089028966] [2019-11-21 11:07:02,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:07:02,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:07:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:07:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:07:02,933 INFO L87 Difference]: Start difference. First operand 218 states and 256 transitions. Second operand 10 states. [2019-11-21 11:07:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:07:06,245 INFO L93 Difference]: Finished difference Result 322 states and 378 transitions. [2019-11-21 11:07:06,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 11:07:06,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 11:07:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:07:06,248 INFO L225 Difference]: With dead ends: 322 [2019-11-21 11:07:06,249 INFO L226 Difference]: Without dead ends: 322 [2019-11-21 11:07:06,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-21 11:07:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-21 11:07:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 234. [2019-11-21 11:07:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-21 11:07:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 274 transitions. [2019-11-21 11:07:06,258 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 274 transitions. Word has length 22 [2019-11-21 11:07:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:07:06,259 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 274 transitions. [2019-11-21 11:07:06,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:07:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 274 transitions. [2019-11-21 11:07:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 11:07:06,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:07:06,261 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:07:06,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:07:06,464 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 11:07:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:07:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash 191017845, now seen corresponding path program 1 times [2019-11-21 11:07:06,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:07:06,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [192440601] [2019-11-21 11:07:06,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:07:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:07:06,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 11:07:06,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:07:06,893 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_174|]} [2019-11-21 11:07:06,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:07:06,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 11:07:06,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:06,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:06,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:07:06,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 11:07:06,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:06,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:06,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:07:06,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-21 11:07:06,948 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-21 11:07:06,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:06,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:06,971 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-21 11:07:06,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:06,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:06,988 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-21 11:07:06,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:28 [2019-11-21 11:07:07,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:07,122 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 97 treesize of output 109 [2019-11-21 11:07:07,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:07:07,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:07,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:07,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:07,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-21 11:07:07,254 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-11-21 11:07:07,255 INFO L567 ElimStorePlain]: treesize reduction 254, result has 22.3 percent of original size [2019-11-21 11:07:07,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:07:07,264 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 52 treesize of output 45 [2019-11-21 11:07:07,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:07,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:07,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:07:07,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:63 [2019-11-21 11:07:13,380 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 11:07:15,455 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 11:07:17,584 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 11:07:17,588 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_71|], 12=[|v_#memory_$Pointer$.offset_70|]} [2019-11-21 11:07:17,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:17,638 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 129 treesize of output 131 [2019-11-21 11:07:17,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:17,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 11:07:17,835 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-11-21 11:07:17,836 INFO L567 ElimStorePlain]: treesize reduction 157, result has 47.1 percent of original size [2019-11-21 11:07:17,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:07:18,061 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-21 11:07:18,062 INFO L343 Elim1Store]: treesize reduction 18, result has 89.8 percent of original size [2019-11-21 11:07:18,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 206 [2019-11-21 11:07:18,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:18,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:07:32,311 WARN L192 SmtUtils]: Spent 14.25 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 11:07:32,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:07:32,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:07:32,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:32,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:32,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:32,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:32,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:07:32,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:251 [2019-11-21 11:07:32,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:07:32,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:32,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:32,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:32,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:38,484 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 11:07:38,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:07:38,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:38,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:38,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:07:38,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:09:12,437 WARN L192 SmtUtils]: Spent 1.43 m on a formula simplification that was a NOOP. DAG size: 77 [2019-11-21 11:10:38,056 WARN L192 SmtUtils]: Spent 1.42 m on a formula simplification that was a NOOP. DAG size: 153 [2019-11-21 11:10:38,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-21 11:10:38,092 INFO L392 ElimStorePlain]: Different costs {156=[|#memory_$Pointer$.base|], 462=[|#memory_$Pointer$.offset|]} [2019-11-21 11:10:38,258 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-21 11:10:38,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 102 [2019-11-21 11:10:38,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:10:38,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:38,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:38,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:10:38,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 135 [2019-11-21 11:10:38,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:10:38,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:38,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:38,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:10:38,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 150 [2019-11-21 11:10:38,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:10:38,582 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:38,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:38,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:10:38,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 150 [2019-11-21 11:10:38,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:10:38,745 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:38,888 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-21 11:10:38,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 122 [2019-11-21 11:10:38,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:10:38,890 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:39,056 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-21 11:10:39,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 165 [2019-11-21 11:10:39,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:10:39,058 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:44,765 WARN L192 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 116 DAG size of output: 115 [2019-11-21 11:10:44,767 INFO L567 ElimStorePlain]: treesize reduction 21, result has 96.2 percent of original size [2019-11-21 11:10:44,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:44,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:44,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:44,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:44,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,107 INFO L237 Elim1Store]: Index analysis took 272 ms [2019-11-21 11:10:45,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:10:45,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 75 [2019-11-21 11:10:45,148 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:45,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,392 INFO L237 Elim1Store]: Index analysis took 195 ms [2019-11-21 11:10:45,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:10:45,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 93 [2019-11-21 11:10:45,433 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:45,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,471 INFO L343 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2019-11-21 11:10:45,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2019-11-21 11:10:45,472 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:45,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,616 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-21 11:10:45,617 INFO L343 Elim1Store]: treesize reduction 36, result has 67.0 percent of original size [2019-11-21 11:10:45,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 105 [2019-11-21 11:10:45,618 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:45,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:10:45,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 60 [2019-11-21 11:10:45,737 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:45,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:10:45,760 INFO L343 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2019-11-21 11:10:45,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 30 [2019-11-21 11:10:45,761 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-21 11:10:45,811 INFO L567 ElimStorePlain]: treesize reduction 88, result has 19.3 percent of original size [2019-11-21 11:10:45,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:10:45,812 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 14 variables, input treesize:1011, output treesize:21 [2019-11-21 11:10:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:10:45,898 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:10:46,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:10:46,446 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-21 11:10:46,475 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:10:46,502 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:10:46,798 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 11:10:46,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:10:46,817 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:10:46,837 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:10:46,863 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:10:47,157 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 11:10:47,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:10:47,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-21 11:10:47,160 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:215, output treesize:250 [2019-11-21 11:10:53,398 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 11:11:05,046 WARN L192 SmtUtils]: Spent 3.58 s on a formula simplification that was a NOOP. DAG size: 86 [2019-11-21 11:11:15,738 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 87 [2019-11-21 11:11:15,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:11:15,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:11:15,959 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 11:11:15,966 INFO L168 Benchmark]: Toolchain (without parser) took 280225.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 956.3 MB in the beginning and 968.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 276.2 MB. Max. memory is 11.5 GB. [2019-11-21 11:11:15,967 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 11:11:15,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -114.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-21 11:11:15,968 INFO L168 Benchmark]: Boogie Preprocessor took 93.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 11:11:15,968 INFO L168 Benchmark]: RCFGBuilder took 1428.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 979.8 MB in the end (delta: 85.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. [2019-11-21 11:11:15,968 INFO L168 Benchmark]: TraceAbstraction took 277943.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.8 MB). Free memory was 979.8 MB in the beginning and 968.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 202.1 MB. Max. memory is 11.5 GB. [2019-11-21 11:11:15,971 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 754.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -114.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1428.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 979.8 MB in the end (delta: 85.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 277943.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.8 MB). Free memory was 979.8 MB in the beginning and 968.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 202.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...