./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f6fb2bb1 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/test-0232-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-f6fb2bb [2019-11-19 19:47:59,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:47:59,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:47:59,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:47:59,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:47:59,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:47:59,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:47:59,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:47:59,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:47:59,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:47:59,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:47:59,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:47:59,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:47:59,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:47:59,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:47:59,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:47:59,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:47:59,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:47:59,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:47:59,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:47:59,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:47:59,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:47:59,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:47:59,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:47:59,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:47:59,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:47:59,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:47:59,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:47:59,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:47:59,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:47:59,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:47:59,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:47:59,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:47:59,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:47:59,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:47:59,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:47:59,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:47:59,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:47:59,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:47:59,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:47:59,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:47:59,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-19 19:47:59,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:47:59,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:47:59,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:47:59,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:47:59,639 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:47:59,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:47:59,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 19:47:59,640 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:47:59,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:47:59,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 19:47:59,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:47:59,641 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-19 19:47:59,641 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-19 19:47:59,641 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-19 19:47:59,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 19:47:59,642 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 19:47:59,642 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 19:47:59,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 19:47:59,643 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:47:59,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:47:59,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:47:59,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 19:47:59,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 19:47:59,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:47:59,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:47:59,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 19:47:59,645 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 19:47:59,645 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 19:47:59,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 19:47:59,646 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab [2019-11-19 19:47:59,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:47:59,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:47:59,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:47:59,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:47:59,989 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:47:59,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2019-11-19 19:48:00,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1e0c139/81894cd77dc445e899d964be87c6f256/FLAG444cbd964 [2019-11-19 19:48:00,523 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:48:00,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2019-11-19 19:48:00,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1e0c139/81894cd77dc445e899d964be87c6f256/FLAG444cbd964 [2019-11-19 19:48:00,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1e0c139/81894cd77dc445e899d964be87c6f256 [2019-11-19 19:48:00,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:48:00,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-19 19:48:00,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:48:00,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:48:00,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:48:00,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:00" (1/1) ... [2019-11-19 19:48:00,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0fa4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:00, skipping insertion in model container [2019-11-19 19:48:00,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:00" (1/1) ... [2019-11-19 19:48:00,900 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:48:00,963 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:48:01,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:48:01,486 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:48:01,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:48:01,596 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:48:01,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01 WrapperNode [2019-11-19 19:48:01,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:48:01,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:48:01,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:48:01,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:48:01,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (1/1) ... [2019-11-19 19:48:01,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (1/1) ... [2019-11-19 19:48:01,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (1/1) ... [2019-11-19 19:48:01,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (1/1) ... [2019-11-19 19:48:01,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (1/1) ... [2019-11-19 19:48:01,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (1/1) ... [2019-11-19 19:48:01,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (1/1) ... [2019-11-19 19:48:01,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:48:01,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:48:01,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:48:01,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:48:01,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (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-19 19:48:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-19 19:48:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:48:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-19 19:48:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-19 19:48:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-19 19:48:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-19 19:48:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-19 19:48:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-19 19:48:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-19 19:48:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-19 19:48:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-19 19:48:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-19 19:48:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-19 19:48:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-19 19:48:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-19 19:48:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-19 19:48:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-19 19:48:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-19 19:48:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-19 19:48:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-19 19:48:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-19 19:48:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-19 19:48:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-19 19:48:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-19 19:48:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-19 19:48:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-19 19:48:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-19 19:48:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-19 19:48:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-19 19:48:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-19 19:48:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-19 19:48:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-19 19:48:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-19 19:48:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-19 19:48:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-19 19:48:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-19 19:48:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-19 19:48:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-19 19:48:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-19 19:48:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-19 19:48:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-19 19:48:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-19 19:48:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-19 19:48:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-19 19:48:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-19 19:48:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-19 19:48:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-19 19:48:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-19 19:48:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-19 19:48:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-19 19:48:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-19 19:48:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-19 19:48:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-19 19:48:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-19 19:48:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-19 19:48:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-19 19:48:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-19 19:48:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-19 19:48:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-19 19:48:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-19 19:48:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-19 19:48:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-19 19:48:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-19 19:48:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-19 19:48:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-19 19:48:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-19 19:48:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-19 19:48:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-19 19:48:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-19 19:48:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-19 19:48:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-19 19:48:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-19 19:48:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-19 19:48:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-19 19:48:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-19 19:48:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-19 19:48:01,750 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-19 19:48:01,750 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-19 19:48:01,750 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-19 19:48:01,750 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-19 19:48:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-19 19:48:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-19 19:48:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-19 19:48:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-19 19:48:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-19 19:48:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-19 19:48:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-19 19:48:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-19 19:48:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-19 19:48:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-19 19:48:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-19 19:48:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-19 19:48:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-19 19:48:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-19 19:48:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-19 19:48:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-19 19:48:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-19 19:48:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-19 19:48:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-19 19:48:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-19 19:48:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-19 19:48:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-19 19:48:01,756 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-19 19:48:01,756 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-19 19:48:01,756 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-19 19:48:01,756 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-19 19:48:01,756 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-19 19:48:01,757 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-19 19:48:01,757 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-19 19:48:01,757 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-19 19:48:01,757 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-19 19:48:01,757 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-19 19:48:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-19 19:48:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-19 19:48:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-19 19:48:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-19 19:48:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-19 19:48:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-19 19:48:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-19 19:48:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 19:48:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 19:48:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 19:48:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-19 19:48:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 19:48:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-19 19:48:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 19:48:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-19 19:48:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:48:02,570 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:48:02,570 INFO L285 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-19 19:48:02,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:02 BoogieIcfgContainer [2019-11-19 19:48:02,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:48:02,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 19:48:02,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 19:48:02,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 19:48:02,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:48:00" (1/3) ... [2019-11-19 19:48:02,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539f6b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:02, skipping insertion in model container [2019-11-19 19:48:02,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:01" (2/3) ... [2019-11-19 19:48:02,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539f6b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:02, skipping insertion in model container [2019-11-19 19:48:02,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:02" (3/3) ... [2019-11-19 19:48:02,581 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2019-11-19 19:48:02,592 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 19:48:02,601 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-11-19 19:48:02,615 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-11-19 19:48:02,638 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 19:48:02,639 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-19 19:48:02,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 19:48:02,639 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:48:02,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:48:02,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 19:48:02,641 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:48:02,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 19:48:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-11-19 19:48:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 19:48:02,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:02,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:02,674 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1838646891, now seen corresponding path program 1 times [2019-11-19 19:48:02,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:02,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2024545164] [2019-11-19 19:48:02,694 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-19 19:48:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:02,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 19:48:02,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:02,982 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-19 19:48:02,982 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:03,003 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-19 19:48:03,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2024545164] [2019-11-19 19:48:03,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:03,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 19:48:03,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874436656] [2019-11-19 19:48:03,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 19:48:03,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 19:48:03,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 19:48:03,035 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2019-11-19 19:48:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:03,069 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-11-19 19:48:03,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 19:48:03,071 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-19 19:48:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:03,085 INFO L225 Difference]: With dead ends: 88 [2019-11-19 19:48:03,085 INFO L226 Difference]: Without dead ends: 85 [2019-11-19 19:48:03,088 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-19 19:48:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-19 19:48:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-19 19:48:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 19:48:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-11-19 19:48:03,152 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2019-11-19 19:48:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:03,153 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-11-19 19:48:03,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 19:48:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-11-19 19:48:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 19:48:03,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:03,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:03,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:03,359 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1163581944, now seen corresponding path program 1 times [2019-11-19 19:48:03,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:03,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [436644345] [2019-11-19 19:48:03,361 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-19 19:48:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:03,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 19:48:03,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:03,646 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-19 19:48:03,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:03,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:03,667 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-19 19:48:03,667 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:03,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:03,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:03,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-19 19:48:03,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:03,745 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-19 19:48:03,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:03,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:03,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:03,775 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 11 treesize of output 7 [2019-11-19 19:48:03,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:03,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:03,787 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-19 19:48:03,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-19 19:48:03,810 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-19 19:48:03,811 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:03,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:04,195 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-19 19:48:04,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [436644345] [2019-11-19 19:48:04,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:04,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-19 19:48:04,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738026427] [2019-11-19 19:48:04,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:48:04,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:04,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:48:04,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:48:04,201 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 8 states. [2019-11-19 19:48:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:06,230 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-11-19 19:48:06,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:48:06,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-19 19:48:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:06,235 INFO L225 Difference]: With dead ends: 103 [2019-11-19 19:48:06,235 INFO L226 Difference]: Without dead ends: 103 [2019-11-19 19:48:06,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:48:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-19 19:48:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2019-11-19 19:48:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 19:48:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-11-19 19:48:06,247 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 9 [2019-11-19 19:48:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:06,248 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-11-19 19:48:06,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:48:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-11-19 19:48:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 19:48:06,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:06,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:06,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:06,452 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:06,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1163581943, now seen corresponding path program 1 times [2019-11-19 19:48:06,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:06,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1950981473] [2019-11-19 19:48:06,455 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-19 19:48:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:06,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 19:48:06,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:06,668 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-19 19:48:06,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:06,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:06,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:06,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 19:48:06,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:06,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-19 19:48:06,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:06,754 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-19 19:48:06,755 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-19 19:48:06,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-19 19:48:06,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-19 19:48:06,772 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:06,833 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-19 19:48:06,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1950981473] [2019-11-19 19:48:06,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:06,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-19 19:48:06,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755624296] [2019-11-19 19:48:06,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:48:06,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:06,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:48:06,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:48:06,837 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 8 states. [2019-11-19 19:48:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:07,215 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-11-19 19:48:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 19:48:07,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-19 19:48:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:07,217 INFO L225 Difference]: With dead ends: 78 [2019-11-19 19:48:07,217 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 19:48:07,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:48:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 19:48:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-19 19:48:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 19:48:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-11-19 19:48:07,226 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 9 [2019-11-19 19:48:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:07,227 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-11-19 19:48:07,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:48:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-11-19 19:48:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 19:48:07,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:07,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:07,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:07,432 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1711301932, now seen corresponding path program 1 times [2019-11-19 19:48:07,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:07,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1275115412] [2019-11-19 19:48:07,434 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-19 19:48:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:07,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:48:07,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:07,643 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-19 19:48:07,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:07,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:07,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:07,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 19:48:07,666 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-19 19:48:07,666 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:07,702 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-19 19:48:07,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1275115412] [2019-11-19 19:48:07,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:07,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-19 19:48:07,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179027651] [2019-11-19 19:48:07,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:48:07,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:07,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:48:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:48:07,708 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 4 states. [2019-11-19 19:48:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:07,869 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-11-19 19:48:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:48:07,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-19 19:48:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:07,871 INFO L225 Difference]: With dead ends: 74 [2019-11-19 19:48:07,871 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 19:48:07,872 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-19 19:48:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 19:48:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-19 19:48:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 19:48:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-11-19 19:48:07,879 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2019-11-19 19:48:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:07,879 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-11-19 19:48:07,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:48:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-11-19 19:48:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 19:48:07,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:07,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:08,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:08,082 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1711301933, now seen corresponding path program 1 times [2019-11-19 19:48:08,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:08,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1173096275] [2019-11-19 19:48:08,085 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-19 19:48:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:08,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:48:08,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:08,247 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-19 19:48:08,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:08,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:08,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:08,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 19:48:08,268 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-19 19:48:08,268 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:08,297 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-19 19:48:08,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1173096275] [2019-11-19 19:48:08,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:08,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-19 19:48:08,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081806647] [2019-11-19 19:48:08,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:48:08,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:08,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:48:08,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:48:08,299 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-11-19 19:48:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:08,496 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-19 19:48:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:48:08,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-19 19:48:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:08,499 INFO L225 Difference]: With dead ends: 70 [2019-11-19 19:48:08,499 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 19:48:08,502 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-19 19:48:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 19:48:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-19 19:48:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 19:48:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-11-19 19:48:08,509 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2019-11-19 19:48:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:08,510 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-11-19 19:48:08,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:48:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-11-19 19:48:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 19:48:08,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:08,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:08,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:08,712 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash 42455267, now seen corresponding path program 1 times [2019-11-19 19:48:08,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:08,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1532057467] [2019-11-19 19:48:08,714 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-19 19:48:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:08,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 19:48:08,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:09,008 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 19:48:09,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-19 19:48:09,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:09,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:09,045 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 19:48:09,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-19 19:48:09,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:09,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:09,063 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-19 19:48:09,064 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-11-19 19:48:09,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:09,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-19 19:48:09,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:09,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:09,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:09,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-19 19:48:09,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:09,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:09,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:09,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-11-19 19:48:09,169 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-19 19:48:09,169 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:09,353 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-19 19:48:09,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1532057467] [2019-11-19 19:48:09,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:09,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-19 19:48:09,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568572947] [2019-11-19 19:48:09,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 19:48:09,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:09,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 19:48:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-19 19:48:09,356 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 13 states. [2019-11-19 19:48:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:10,265 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-11-19 19:48:10,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 19:48:10,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-19 19:48:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:10,268 INFO L225 Difference]: With dead ends: 82 [2019-11-19 19:48:10,268 INFO L226 Difference]: Without dead ends: 82 [2019-11-19 19:48:10,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-11-19 19:48:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-19 19:48:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2019-11-19 19:48:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 19:48:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-19 19:48:10,291 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2019-11-19 19:48:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:10,291 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-19 19:48:10,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 19:48:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-19 19:48:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 19:48:10,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:10,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:10,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:10,497 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:10,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1739337176, now seen corresponding path program 1 times [2019-11-19 19:48:10,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:10,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1820168974] [2019-11-19 19:48:10,499 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-19 19:48:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:10,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 19:48:10,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:10,754 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-19 19:48:10,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:10,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:10,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:10,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-19 19:48:10,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:10,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:10,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:10,796 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-19 19:48:10,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-19 19:48:10,849 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 11 [2019-11-19 19:48:10,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:10,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:10,854 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-19 19:48:10,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-19 19:48:10,873 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-19 19:48:10,874 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:11,003 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 32 treesize of output 28 [2019-11-19 19:48:11,005 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-19 19:48:11,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:11,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:11,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-19 19:48:11,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:11,134 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 10 treesize of output 8 [2019-11-19 19:48:11,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:11,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 19:48:11,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:11,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:11,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 19:48:11,151 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-19 19:48:11,161 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-19 19:48:11,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1820168974] [2019-11-19 19:48:11,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:11,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-19 19:48:11,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750648893] [2019-11-19 19:48:11,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 19:48:11,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 19:48:11,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:48:11,163 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 10 states. [2019-11-19 19:48:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:11,710 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-11-19 19:48:11,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:48:11,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-19 19:48:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:11,711 INFO L225 Difference]: With dead ends: 85 [2019-11-19 19:48:11,711 INFO L226 Difference]: Without dead ends: 85 [2019-11-19 19:48:11,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-19 19:48:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-19 19:48:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-11-19 19:48:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-19 19:48:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-11-19 19:48:11,719 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2019-11-19 19:48:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:11,721 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-11-19 19:48:11,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 19:48:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-11-19 19:48:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 19:48:11,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:11,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:11,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:11,926 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:11,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1739337175, now seen corresponding path program 1 times [2019-11-19 19:48:11,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:11,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1919553598] [2019-11-19 19:48:11,928 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-19 19:48:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:12,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 19:48:12,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:12,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:12,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:12,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:12,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:12,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:12,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:12,279 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-19 19:48:12,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-11-19 19:48:12,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-19 19:48:12,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:12,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:12,351 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-19 19:48:12,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:12,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:12,365 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-19 19:48:12,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-19 19:48:12,407 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-19 19:48:12,407 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:12,800 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 28 treesize of output 24 [2019-11-19 19:48:12,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-19 19:48:12,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:12,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:12,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:12,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:12,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:12,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:12,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:12,892 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:12,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:12,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:12,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:12,928 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:12,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:12,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-19 19:48:12,951 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:22 [2019-11-19 19:48:13,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 19:48:13,032 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 12 treesize of output 10 [2019-11-19 19:48:13,033 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-19 19:48:13,055 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 16 treesize of output 12 [2019-11-19 19:48:13,057 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-19 19:48:13,066 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 12 treesize of output 10 [2019-11-19 19:48:13,066 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-19 19:48:13,081 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 12 treesize of output 10 [2019-11-19 19:48:13,083 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-19 19:48:13,102 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 14 treesize of output 12 [2019-11-19 19:48:13,103 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-19 19:48:13,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:13,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2019-11-19 19:48:13,184 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:67, output treesize:55 [2019-11-19 19:48:13,393 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-11-19 19:48:13,413 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-19 19:48:13,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1919553598] [2019-11-19 19:48:13,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:13,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-11-19 19:48:13,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692095313] [2019-11-19 19:48:13,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 19:48:13,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:13,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 19:48:13,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-19 19:48:13,416 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 13 states. [2019-11-19 19:48:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:14,434 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-11-19 19:48:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:48:14,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-19 19:48:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:14,436 INFO L225 Difference]: With dead ends: 87 [2019-11-19 19:48:14,436 INFO L226 Difference]: Without dead ends: 87 [2019-11-19 19:48:14,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:48:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-19 19:48:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-19 19:48:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 19:48:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-19 19:48:14,443 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 23 [2019-11-19 19:48:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:14,443 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-19 19:48:14,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 19:48:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-19 19:48:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 19:48:14,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:14,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:14,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:14,649 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:14,650 INFO L82 PathProgramCache]: Analyzing trace with hash -740581632, now seen corresponding path program 1 times [2019-11-19 19:48:14,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:14,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1745526227] [2019-11-19 19:48:14,651 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-19 19:48:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:14,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 19:48:14,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:14,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:14,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:14,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:14,922 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-19 19:48:14,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-19 19:48:14,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-19 19:48:14,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:14,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:14,950 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-19 19:48:14,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-19 19:48:14,959 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-19 19:48:14,959 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:15,069 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 30 treesize of output 26 [2019-11-19 19:48:15,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-19 19:48:15,089 INFO L567 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-11-19 19:48:15,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-19 19:48:15,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2019-11-19 19:48:15,098 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-19 19:48:15,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1745526227] [2019-11-19 19:48:15,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:15,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 8 [2019-11-19 19:48:15,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126269004] [2019-11-19 19:48:15,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:48:15,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:15,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:48:15,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:48:15,100 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 8 states. [2019-11-19 19:48:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:15,429 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-19 19:48:15,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:48:15,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-19 19:48:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:15,430 INFO L225 Difference]: With dead ends: 69 [2019-11-19 19:48:15,431 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 19:48:15,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:48:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 19:48:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-19 19:48:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 19:48:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-19 19:48:15,445 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2019-11-19 19:48:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:15,445 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-19 19:48:15,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:48:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-19 19:48:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 19:48:15,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:15,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:15,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:15,649 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:15,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2108347266, now seen corresponding path program 1 times [2019-11-19 19:48:15,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:15,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1558367543] [2019-11-19 19:48:15,651 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-19 19:48:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:15,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 19:48:15,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:15,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:15,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:15,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:15,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:15,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 19:48:15,918 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-19 19:48:15,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:15,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:15,920 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-19 19:48:15,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 19:48:15,929 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-19 19:48:15,930 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:16,029 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 28 treesize of output 24 [2019-11-19 19:48:16,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-19 19:48:16,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:16,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-19 19:48:16,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-19 19:48:16,052 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-19 19:48:16,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1558367543] [2019-11-19 19:48:16,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:16,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2019-11-19 19:48:16,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753100632] [2019-11-19 19:48:16,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:48:16,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:48:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:48:16,054 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2019-11-19 19:48:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:16,313 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-19 19:48:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:48:16,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-19 19:48:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:16,315 INFO L225 Difference]: With dead ends: 68 [2019-11-19 19:48:16,315 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 19:48:16,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:48:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 19:48:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-19 19:48:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 19:48:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-19 19:48:16,319 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-19 19:48:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:16,320 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-19 19:48:16,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:48:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-19 19:48:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 19:48:16,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:16,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:16,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:16,523 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash -934255735, now seen corresponding path program 1 times [2019-11-19 19:48:16,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:16,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [222024473] [2019-11-19 19:48:16,524 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-19 19:48:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:16,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 19:48:16,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:16,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:16,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:16,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:16,808 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-19 19:48:16,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-11-19 19:48:16,840 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-19 19:48:16,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:16,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:16,843 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-19 19:48:16,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 19:48:16,856 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-19 19:48:16,856 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:16,981 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 28 treesize of output 24 [2019-11-19 19:48:16,982 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-19 19:48:17,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:17,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:17,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-11-19 19:48:17,044 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-19 19:48:17,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [222024473] [2019-11-19 19:48:17,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:17,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2019-11-19 19:48:17,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863975047] [2019-11-19 19:48:17,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:48:17,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:17,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:48:17,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:48:17,046 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2019-11-19 19:48:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:17,515 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-19 19:48:17,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:48:17,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-19 19:48:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:17,518 INFO L225 Difference]: With dead ends: 67 [2019-11-19 19:48:17,518 INFO L226 Difference]: Without dead ends: 67 [2019-11-19 19:48:17,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:48:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-19 19:48:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-19 19:48:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-19 19:48:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-11-19 19:48:17,531 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 27 [2019-11-19 19:48:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:17,531 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-11-19 19:48:17,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:48:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-11-19 19:48:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 19:48:17,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:17,534 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:17,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:17,736 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:17,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1314824630, now seen corresponding path program 1 times [2019-11-19 19:48:17,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:17,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [828011879] [2019-11-19 19:48:17,738 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-19 19:48:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:18,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 19:48:18,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:18,046 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-19 19:48:18,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,065 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-19 19:48:18,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-11-19 19:48:18,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:18,115 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 12 treesize of output 14 [2019-11-19 19:48:18,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-19 19:48:18,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,173 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-19 19:48:18,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-11-19 19:48:18,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:18,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:18,273 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:18,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:43 [2019-11-19 19:48:18,414 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_145|], 3=[|v_#length_93|]} [2019-11-19 19:48:18,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-19 19:48:18,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,469 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 40 [2019-11-19 19:48:18,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,530 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-19 19:48:18,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:18,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2019-11-19 19:48:18,650 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 19:48:18,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-19 19:48:18,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,701 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 19:48:18,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-19 19:48:18,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,724 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-19 19:48:18,724 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:54 [2019-11-19 19:48:18,817 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2019-11-19 19:48:18,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,849 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-19 19:48:18,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:18,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:18,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:18,862 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2019-11-19 19:48:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:48:18,915 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:20,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-19 19:48:20,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:20,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:20,339 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 72 treesize of output 68 [2019-11-19 19:48:20,340 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-19 19:48:20,466 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-19 19:48:20,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:20,486 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 46 treesize of output 38 [2019-11-19 19:48:20,490 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:20,608 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-19 19:48:20,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:20,623 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 108 treesize of output 100 [2019-11-19 19:48:20,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:20,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,629 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-19 19:48:20,892 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-19 19:48:20,893 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.3 percent of original size [2019-11-19 19:48:20,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:20,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-11-19 19:48:20,897 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:104, output treesize:85 [2019-11-19 19:48:20,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:20,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:20,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:21,195 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-19 19:48:21,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:21,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:21,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:21,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:21,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:21,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:21,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:21,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:21,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:21,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:21,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:21,485 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 18 treesize of output 22 [2019-11-19 19:48:21,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:21,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:21,507 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 26 treesize of output 30 [2019-11-19 19:48:21,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:21,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:21,542 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 33 treesize of output 37 [2019-11-19 19:48:21,542 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:21,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:21,573 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 26 treesize of output 30 [2019-11-19 19:48:21,573 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:21,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:21,609 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 31 treesize of output 35 [2019-11-19 19:48:21,609 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:21,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:21,632 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 20 treesize of output 24 [2019-11-19 19:48:21,633 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:21,889 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-19 19:48:21,890 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-19 19:48:21,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2019-11-19 19:48:21,892 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:155, output treesize:69 [2019-11-19 19:48:22,284 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-11-19 19:48:22,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 19:48:22,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:22,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:22,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:22,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:22,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:22,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:23,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:23,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:23,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:48:23,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [828011879] [2019-11-19 19:48:23,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:48:23,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-11-19 19:48:23,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846769486] [2019-11-19 19:48:23,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 19:48:23,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 19:48:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-19 19:48:23,560 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 21 states. [2019-11-19 19:48:24,869 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-11-19 19:48:25,092 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-19 19:48:25,530 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-11-19 19:48:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:27,798 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-11-19 19:48:27,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 19:48:27,799 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-19 19:48:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:27,800 INFO L225 Difference]: With dead ends: 73 [2019-11-19 19:48:27,800 INFO L226 Difference]: Without dead ends: 73 [2019-11-19 19:48:27,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-11-19 19:48:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-19 19:48:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-11-19 19:48:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 19:48:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-19 19:48:27,805 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2019-11-19 19:48:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:27,805 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-19 19:48:27,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 19:48:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-19 19:48:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 19:48:27,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:27,806 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:28,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:28,010 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1314824631, now seen corresponding path program 1 times [2019-11-19 19:48:28,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:28,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1693763721] [2019-11-19 19:48:28,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:28,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-19 19:48:28,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:28,304 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-19 19:48:28,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:28,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:28,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:28,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-19 19:48:28,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:28,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:28,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:28,340 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-19 19:48:28,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-19 19:48:28,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:28,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 46 [2019-11-19 19:48:28,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:28,429 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-19 19:48:28,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:28,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-11-19 19:48:28,492 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 19:48:28,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2019-11-19 19:48:28,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:28,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:28,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:28,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-19 19:48:28,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:28,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2019-11-19 19:48:28,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:28,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:28,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:28,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-11-19 19:48:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:48:28,600 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:28,942 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 32 treesize of output 28 [2019-11-19 19:48:28,943 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-19 19:48:28,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:28,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:28,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-19 19:48:29,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:29,113 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:29,114 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 17 treesize of output 21 [2019-11-19 19:48:29,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:29,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:29,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:29,126 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 17 treesize of output 21 [2019-11-19 19:48:29,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:29,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:29,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:29,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 19:48:29,144 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2019-11-19 19:48:29,151 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 10 treesize of output 8 [2019-11-19 19:48:29,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:29,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 19:48:29,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:29,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:29,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 19:48:29,161 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-19 19:48:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:48:29,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1693763721] [2019-11-19 19:48:29,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:48:29,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-19 19:48:29,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881999961] [2019-11-19 19:48:29,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 19:48:29,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 19:48:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-19 19:48:29,172 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2019-11-19 19:48:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:30,513 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-11-19 19:48:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 19:48:30,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-11-19 19:48:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:30,515 INFO L225 Difference]: With dead ends: 72 [2019-11-19 19:48:30,515 INFO L226 Difference]: Without dead ends: 72 [2019-11-19 19:48:30,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-11-19 19:48:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-19 19:48:30,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-19 19:48:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 19:48:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-19 19:48:30,522 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 28 [2019-11-19 19:48:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:30,522 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-19 19:48:30,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 19:48:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-19 19:48:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 19:48:30,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:30,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:30,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:30,727 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1102843360, now seen corresponding path program 1 times [2019-11-19 19:48:30,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:30,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1445136768] [2019-11-19 19:48:30,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:30,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 19:48:30,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:30,981 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-19 19:48:30,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:30,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:30,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:30,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-19 19:48:31,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:31,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:31,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:31,029 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-19 19:48:31,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-19 19:48:31,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-19 19:48:31,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:31,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:31,057 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-19 19:48:31,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-19 19:48:31,067 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-19 19:48:31,068 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:31,179 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 32 treesize of output 28 [2019-11-19 19:48:31,180 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-19 19:48:31,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:31,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:48:31,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-19 19:48:31,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:48:31,291 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 10 treesize of output 8 [2019-11-19 19:48:31,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:31,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 19:48:31,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:31,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:31,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 19:48:31,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-19 19:48:31,306 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-19 19:48:31,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1445136768] [2019-11-19 19:48:31,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:31,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-19 19:48:31,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671543524] [2019-11-19 19:48:31,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 19:48:31,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:31,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 19:48:31,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:48:31,307 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 10 states. [2019-11-19 19:48:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:31,764 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-11-19 19:48:31,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:48:31,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-19 19:48:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:31,767 INFO L225 Difference]: With dead ends: 69 [2019-11-19 19:48:31,767 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 19:48:31,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-19 19:48:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 19:48:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-19 19:48:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 19:48:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-11-19 19:48:31,770 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 28 [2019-11-19 19:48:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:31,770 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-11-19 19:48:31,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 19:48:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-11-19 19:48:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 19:48:31,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:31,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:31,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:31,979 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -171594132, now seen corresponding path program 1 times [2019-11-19 19:48:31,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:31,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1310558684] [2019-11-19 19:48:31,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:32,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 19:48:32,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:32,247 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-19 19:48:32,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 19:48:32,284 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-19 19:48:32,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-11-19 19:48:32,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 19:48:32,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,307 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-19 19:48:32,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-19 19:48:32,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,333 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 15 treesize of output 19 [2019-11-19 19:48:32,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-19 19:48:32,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-19 19:48:32,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-19 19:48:32,402 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 12 treesize of output 14 [2019-11-19 19:48:32,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,415 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-19 19:48:32,415 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-19 19:48:32,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-19 19:48:32,442 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-19 19:48:32,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:32,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:32,676 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 8 treesize of output 6 [2019-11-19 19:48:32,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,686 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 6 treesize of output 4 [2019-11-19 19:48:32,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-19 19:48:32,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:32,761 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 31 treesize of output 29 [2019-11-19 19:48:32,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,783 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 22 treesize of output 26 [2019-11-19 19:48:32,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:48:32,784 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 19:48:32,820 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 31 treesize of output 27 [2019-11-19 19:48:32,821 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,880 INFO L567 ElimStorePlain]: treesize reduction 5, result has 85.7 percent of original size [2019-11-19 19:48:32,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 19:48:32,881 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:54, output treesize:30 [2019-11-19 19:48:32,939 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 19 treesize of output 17 [2019-11-19 19:48:32,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-11-19 19:48:32,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,949 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 18 treesize of output 16 [2019-11-19 19:48:32,949 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 19:48:32,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:48:32,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-19 19:48:32,975 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:56, output treesize:38 [2019-11-19 19:48:33,034 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-19 19:48:33,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1310558684] [2019-11-19 19:48:33,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:33,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-19 19:48:33,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287092930] [2019-11-19 19:48:33,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 19:48:33,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:33,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 19:48:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-19 19:48:33,036 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 14 states. [2019-11-19 19:48:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:37,822 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-11-19 19:48:37,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 19:48:37,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-19 19:48:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:37,825 INFO L225 Difference]: With dead ends: 86 [2019-11-19 19:48:37,825 INFO L226 Difference]: Without dead ends: 86 [2019-11-19 19:48:37,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-11-19 19:48:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-19 19:48:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-11-19 19:48:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 19:48:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-19 19:48:37,829 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2019-11-19 19:48:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:37,829 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-19 19:48:37,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 19:48:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-19 19:48:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 19:48:37,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:37,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:38,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:38,035 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash -171594131, now seen corresponding path program 1 times [2019-11-19 19:48:38,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:38,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [474998795] [2019-11-19 19:48:38,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:48:38,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:48:38,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:48:38,247 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-19 19:48:38,247 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:48:38,263 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-19 19:48:38,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [474998795] [2019-11-19 19:48:38,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:48:38,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 19:48:38,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448312324] [2019-11-19 19:48:38,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:48:38,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:48:38,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:48:38,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:48:38,264 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 3 states. [2019-11-19 19:48:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:48:38,383 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-19 19:48:38,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:48:38,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 19:48:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:48:38,386 INFO L225 Difference]: With dead ends: 63 [2019-11-19 19:48:38,386 INFO L226 Difference]: Without dead ends: 63 [2019-11-19 19:48:38,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-19 19:48:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-19 19:48:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-19 19:48:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-19 19:48:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-19 19:48:38,389 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2019-11-19 19:48:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:48:38,390 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-19 19:48:38,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:48:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-19 19:48:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 19:48:38,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:48:38,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:48:38,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:38,593 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 19:48:38,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:48:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash 624655538, now seen corresponding path program 1 times [2019-11-19 19:48:38,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:48:38,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1638927954] [2019-11-19 19:48:38,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:48:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:48:39,175 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-19 19:48:39,176 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 19:48:39,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:48:39,399 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-19 19:48:39,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:48:39 BoogieIcfgContainer [2019-11-19 19:48:39,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 19:48:39,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:48:39,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:48:39,435 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:48:39,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:02" (3/4) ... [2019-11-19 19:48:39,439 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 19:48:39,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:48:39,441 INFO L168 Benchmark]: Toolchain (without parser) took 38561.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 956.3 MB in the beginning and 826.3 MB in the end (delta: 130.1 MB). Peak memory consumption was 466.6 MB. Max. memory is 11.5 GB. [2019-11-19 19:48:39,441 INFO L168 Benchmark]: CDTParser took 0.92 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:48:39,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-19 19:48:39,442 INFO L168 Benchmark]: Boogie Preprocessor took 78.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:48:39,442 INFO L168 Benchmark]: RCFGBuilder took 896.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-19 19:48:39,442 INFO L168 Benchmark]: TraceAbstraction took 36860.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 826.3 MB in the end (delta: 239.0 MB). Peak memory consumption was 428.3 MB. Max. memory is 11.5 GB. [2019-11-19 19:48:39,443 INFO L168 Benchmark]: Witness Printer took 4.82 ms. Allocated memory is still 1.4 GB. Free memory is still 826.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:48:39,445 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.92 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 715.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 896.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36860.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 826.3 MB in the end (delta: 239.0 MB). Peak memory consumption was 428.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.82 ms. Allocated memory is still 1.4 GB. Free memory is still 826.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 526]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 526. Possible FailurePath: [L528] struct item *list = ((void *)0); VAL [list={-1195371520:0}] [L530] CALL append(&list) VAL [plist={-1195371520:0}] [L519] struct item *item = malloc(sizeof *item); VAL [item={1195174879:0}, malloc(sizeof *item)={1195174879:0}, plist={-1195371520:0}, plist={-1195371520:0}] [L520] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1195174879:0}, malloc(sizeof *item)={1195174879:0}, plist={-1195371520:0}, plist={-1195371520:0}] [L520] item->next = *plist VAL [\read(**plist)={0:0}, item={1195174879:0}, malloc(sizeof *item)={1195174879:0}, plist={-1195371520:0}, plist={-1195371520:0}] [L521] EXPR item->next VAL [item={1195174879:0}, item->next={0:0}, malloc(sizeof *item)={1195174879:0}, plist={-1195371520:0}, plist={-1195371520:0}] [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-658498560:0}, item={1195174879:0}, item->next={0:0}, malloc(sizeof *item)={1195174879:0}, malloc(sizeof *item)={-658498560:0}, plist={-1195371520:0}, plist={-1195371520:0}] [L521-L523] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-658498560:0}, item={1195174879:0}, item->next={0:0}, malloc(sizeof *item)={1195174879:0}, malloc(sizeof *item)={-658498560:0}, plist={-1195371520:0}, plist={-1195371520:0}] [L524] *plist = item VAL [item={1195174879:0}, malloc(sizeof *item)={1195174879:0}, malloc(sizeof *item)={-658498560:0}, plist={-1195371520:0}, plist={-1195371520:0}] [L530] RET append(&list) VAL [list={-1195371520:0}] [L531] COND FALSE !(__VERIFIER_nondet_int()) [L532] \read(*list) VAL [\read(*list)={1195174879:0}, list={-1195371520:0}] [L532] COND TRUE \read(*list) [L533] EXPR \read(*list) VAL [\read(*list)={1195174879:0}, list={-1195371520:0}] [L533] EXPR list->next VAL [\read(*list)={1195174879:0}, list={-1195371520:0}, list->next={0:0}] [L533] struct item *next = list->next; [L534] EXPR \read(*list) VAL [\read(*list)={1195174879:0}, list={-1195371520:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={1195174879:0}, list={-1195371520:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={1195174879:0}, list={-1195371520:0}, next={0:0}] [L534] free(list) [L535] list = next VAL [list={-1195371520:0}, next={0:0}] [L537] \read(*list) VAL [\read(*list)={0:0}, list={-1195371520:0}, next={0:0}] [L537] COND FALSE !(\read(*list)) [L542] return 0; [L528] struct item *list = ((void *)0); [L542] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 103 locations, 41 error locations. Result: UNSAFE, OverallTime: 36.7s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 714 SDtfs, 1079 SDslu, 2447 SDs, 0 SdLazy, 3165 SolverSat, 173 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 502 SyntacticMatches, 17 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 622 ConstructedInterpolants, 56 QuantifiedInterpolants, 155057 SizeOfPredicates, 164 NumberOfNonLiveVariables, 1584 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...