./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.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 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.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 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:53:20,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:53:20,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:53:20,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:53:20,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:53:20,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:53:20,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:53:20,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:53:20,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:53:20,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:53:20,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:53:20,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:53:20,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:53:20,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:53:20,665 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:53:20,666 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:53:20,667 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:53:20,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:53:20,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:53:20,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:53:20,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:53:20,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:53:20,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:53:20,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:53:20,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:53:20,683 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:53:20,684 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:53:20,686 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:53:20,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:53:20,688 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:53:20,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:53:20,689 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:53:20,689 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:53:20,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:53:20,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:53:20,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:53:20,692 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:53:20,708 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:53:20,708 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:53:20,709 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:53:20,710 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:53:20,710 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:53:20,710 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:53:20,711 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:53:20,711 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:53:20,711 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:53:20,711 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:53:20,711 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:53:20,712 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:53:20,712 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:53:20,712 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:53:20,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:53:20,712 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:53:20,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:53:20,714 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:53:20,714 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:53:20,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:53:20,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:53:20,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:53:20,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:53:20,715 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:53:20,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:53:20,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2019-01-14 18:53:20,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:53:20,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:53:20,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:53:20,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:53:20,797 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:53:20,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:20,879 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a308d9d/2eb3aaa5ad4b411ab0ef386dafc6fc7f/FLAG3138da7d1 [2019-01-14 18:53:21,406 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:53:21,407 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:21,419 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a308d9d/2eb3aaa5ad4b411ab0ef386dafc6fc7f/FLAG3138da7d1 [2019-01-14 18:53:21,720 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a308d9d/2eb3aaa5ad4b411ab0ef386dafc6fc7f [2019-01-14 18:53:21,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:53:21,725 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:53:21,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:21,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:53:21,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:53:21,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:21" (1/1) ... [2019-01-14 18:53:21,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ef615a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:21, skipping insertion in model container [2019-01-14 18:53:21,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:21" (1/1) ... [2019-01-14 18:53:21,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:53:21,794 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:53:22,152 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:22,172 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:53:22,323 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:22,399 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:53:22,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22 WrapperNode [2019-01-14 18:53:22,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:22,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:53:22,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:53:22,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:53:22,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (1/1) ... [2019-01-14 18:53:22,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (1/1) ... [2019-01-14 18:53:22,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (1/1) ... [2019-01-14 18:53:22,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (1/1) ... [2019-01-14 18:53:22,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (1/1) ... [2019-01-14 18:53:22,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (1/1) ... [2019-01-14 18:53:22,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (1/1) ... [2019-01-14 18:53:22,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:53:22,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:53:22,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:53:22,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:53:22,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (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-01-14 18:53:22,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:53:22,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:53:22,569 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-14 18:53:22,569 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-14 18:53:22,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:53:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:53:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:53:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:53:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:53:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:53:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:53:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:53:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:53:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:53:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:53:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:53:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:53:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:53:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:53:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:53:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:53:22,574 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:53:22,575 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:53:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:53:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:53:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:53:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:53:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:53:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:53:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:53:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:53:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:53:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:53:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:53:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:53:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:53:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:53:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:53:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:53:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:53:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:53:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:53:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:53:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:53:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:53:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:53:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:53:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:53:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:53:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:53:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:53:22,588 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:53:22,588 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:53:22,588 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:53:22,588 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:53:22,588 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:53:22,588 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:53:22,589 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:53:22,589 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:53:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:53:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:53:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:53:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:53:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:53:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:53:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:53:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:53:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:53:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:53:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:53:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:53:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:53:22,594 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:53:22,594 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:53:22,594 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:53:22,594 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:53:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:53:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:53:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:53:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:53:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:53:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:53:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:53:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:53:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:53:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:53:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:53:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:53:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:53:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:53:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:53:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-14 18:53:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:53:22,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:53:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:53:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:53:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-14 18:53:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:53:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:53:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:53:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:53:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:53:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:53:23,378 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:53:23,381 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-14 18:53:23,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:23 BoogieIcfgContainer [2019-01-14 18:53:23,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:53:23,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:53:23,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:53:23,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:53:23,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:53:21" (1/3) ... [2019-01-14 18:53:23,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb9a7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:23, skipping insertion in model container [2019-01-14 18:53:23,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:22" (2/3) ... [2019-01-14 18:53:23,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb9a7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:23, skipping insertion in model container [2019-01-14 18:53:23,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:23" (3/3) ... [2019-01-14 18:53:23,394 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:23,408 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:53:23,420 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-14 18:53:23,437 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-14 18:53:23,464 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:53:23,465 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:53:23,465 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:53:23,465 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:53:23,467 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:53:23,468 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:53:23,468 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:53:23,468 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:53:23,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:53:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-14 18:53:23,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:23,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:23,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:23,500 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:23,506 INFO L82 PathProgramCache]: Analyzing trace with hash -515788903, now seen corresponding path program 1 times [2019-01-14 18:53:23,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:23,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:23,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:23,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-01-14 18:53:23,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:23,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:23,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:23,903 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2019-01-14 18:53:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:24,438 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-14 18:53:24,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:24,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:53:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:24,451 INFO L225 Difference]: With dead ends: 70 [2019-01-14 18:53:24,451 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 18:53:24,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 18:53:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-14 18:53:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 18:53:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-14 18:53:24,491 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2019-01-14 18:53:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:24,492 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-14 18:53:24,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-14 18:53:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:24,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:24,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:24,494 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -515788902, now seen corresponding path program 1 times [2019-01-14 18:53:24,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:24,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:24,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:24,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:24,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:24,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:24,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:24,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:24,858 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2019-01-14 18:53:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:25,150 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-14 18:53:25,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:25,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:53:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:25,154 INFO L225 Difference]: With dead ends: 66 [2019-01-14 18:53:25,154 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 18:53:25,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 18:53:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-14 18:53:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 18:53:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-14 18:53:25,163 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 9 [2019-01-14 18:53:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:25,163 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-14 18:53:25,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-14 18:53:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:53:25,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:25,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:25,165 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:25,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:25,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1751897317, now seen corresponding path program 1 times [2019-01-14 18:53:25,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:25,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:25,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:25,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:25,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:53:25,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:53:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:53:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:25,346 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 6 states. [2019-01-14 18:53:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:25,535 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-14 18:53:25,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:53:25,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-14 18:53:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:25,538 INFO L225 Difference]: With dead ends: 63 [2019-01-14 18:53:25,538 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 18:53:25,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 18:53:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 18:53:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 18:53:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-14 18:53:25,547 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2019-01-14 18:53:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:25,548 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-14 18:53:25,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:53:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-14 18:53:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:53:25,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:25,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:25,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash 53856989, now seen corresponding path program 1 times [2019-01-14 18:53:25,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:25,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:25,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:25,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:25,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:25,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:25,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:25,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:25,675 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2019-01-14 18:53:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:25,909 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-14 18:53:25,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:53:25,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 18:53:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:25,912 INFO L225 Difference]: With dead ends: 62 [2019-01-14 18:53:25,912 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 18:53:25,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 18:53:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-14 18:53:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 18:53:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-14 18:53:25,920 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 13 [2019-01-14 18:53:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:25,920 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-14 18:53:25,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-14 18:53:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:53:25,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:25,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:25,922 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash 53856990, now seen corresponding path program 1 times [2019-01-14 18:53:25,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:25,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:25,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:25,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:26,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:26,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:53:26,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:53:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:53:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:26,123 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 6 states. [2019-01-14 18:53:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:26,395 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-14 18:53:26,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:53:26,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-14 18:53:26,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:26,396 INFO L225 Difference]: With dead ends: 61 [2019-01-14 18:53:26,396 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 18:53:26,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 18:53:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-14 18:53:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 18:53:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-14 18:53:26,404 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 13 [2019-01-14 18:53:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:26,405 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-14 18:53:26,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:53:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-14 18:53:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:53:26,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:26,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:26,407 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1864217314, now seen corresponding path program 1 times [2019-01-14 18:53:26,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:26,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:26,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:26,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:26,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:53:26,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:53:26,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:53:26,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:53:26,786 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 11 states. [2019-01-14 18:53:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:27,117 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-14 18:53:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:53:27,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-14 18:53:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:27,120 INFO L225 Difference]: With dead ends: 60 [2019-01-14 18:53:27,121 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 18:53:27,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-01-14 18:53:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 18:53:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-14 18:53:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 18:53:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-14 18:53:27,129 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 16 [2019-01-14 18:53:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:27,130 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-14 18:53:27,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:53:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-14 18:53:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:53:27,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:27,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:27,131 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:27,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1864217313, now seen corresponding path program 1 times [2019-01-14 18:53:27,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:27,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:27,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:27,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:27,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:53:27,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:53:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:53:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:53:27,413 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2019-01-14 18:53:27,827 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-01-14 18:53:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:28,190 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-14 18:53:28,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:53:28,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-14 18:53:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:28,192 INFO L225 Difference]: With dead ends: 59 [2019-01-14 18:53:28,193 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 18:53:28,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-01-14 18:53:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 18:53:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-14 18:53:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 18:53:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-14 18:53:28,204 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 16 [2019-01-14 18:53:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:28,204 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-14 18:53:28,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:53:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-14 18:53:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:53:28,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:28,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:28,205 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:28,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:28,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1351600001, now seen corresponding path program 1 times [2019-01-14 18:53:28,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:28,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:28,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:28,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:28,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:28,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:28,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:53:28,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:53:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:53:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:28,334 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 8 states. [2019-01-14 18:53:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:28,574 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-14 18:53:28,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:53:28,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-14 18:53:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:28,577 INFO L225 Difference]: With dead ends: 63 [2019-01-14 18:53:28,577 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 18:53:28,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 18:53:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-01-14 18:53:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 18:53:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-14 18:53:28,586 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 22 [2019-01-14 18:53:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:28,586 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-14 18:53:28,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:53:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-14 18:53:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:53:28,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:28,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:28,588 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1351600002, now seen corresponding path program 1 times [2019-01-14 18:53:28,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:28,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:28,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:28,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:28,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:28,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:28,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:53:28,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:53:28,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:53:28,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:28,826 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 9 states. [2019-01-14 18:53:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:28,979 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-14 18:53:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:53:28,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-14 18:53:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:28,981 INFO L225 Difference]: With dead ends: 53 [2019-01-14 18:53:28,981 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 18:53:28,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:53:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 18:53:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-14 18:53:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 18:53:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-14 18:53:28,986 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 22 [2019-01-14 18:53:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:28,986 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-14 18:53:28,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:53:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-14 18:53:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:53:28,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:28,987 INFO L402 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-01-14 18:53:28,988 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1819311235, now seen corresponding path program 1 times [2019-01-14 18:53:28,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:28,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:28,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:29,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:29,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-14 18:53:29,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:53:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:53:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:53:29,491 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 16 states. [2019-01-14 18:53:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:30,465 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-14 18:53:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 18:53:30,465 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-01-14 18:53:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:30,469 INFO L225 Difference]: With dead ends: 54 [2019-01-14 18:53:30,470 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 18:53:30,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-01-14 18:53:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 18:53:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-14 18:53:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 18:53:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-14 18:53:30,474 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2019-01-14 18:53:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:30,474 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-14 18:53:30,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:53:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-14 18:53:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:53:30,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:30,476 INFO L402 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-01-14 18:53:30,476 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:30,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1819311236, now seen corresponding path program 1 times [2019-01-14 18:53:30,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:31,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:31,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-14 18:53:31,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:53:31,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:53:31,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:53:31,214 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2019-01-14 18:53:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:32,246 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-14 18:53:32,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 18:53:32,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-01-14 18:53:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:32,249 INFO L225 Difference]: With dead ends: 49 [2019-01-14 18:53:32,249 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 18:53:32,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-01-14 18:53:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 18:53:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-14 18:53:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 18:53:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-14 18:53:32,255 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 26 [2019-01-14 18:53:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:32,255 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-14 18:53:32,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:53:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-14 18:53:32,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:53:32,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:32,256 INFO L402 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-01-14 18:53:32,257 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:32,257 INFO L82 PathProgramCache]: Analyzing trace with hash 564073450, now seen corresponding path program 1 times [2019-01-14 18:53:32,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:32,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:32,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:32,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:32,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-14 18:53:32,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:53:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:53:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:53:32,895 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 16 states. [2019-01-14 18:53:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:34,048 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-14 18:53:34,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 18:53:34,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-01-14 18:53:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:34,051 INFO L225 Difference]: With dead ends: 51 [2019-01-14 18:53:34,051 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 18:53:34,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2019-01-14 18:53:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 18:53:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-14 18:53:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 18:53:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-14 18:53:34,057 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2019-01-14 18:53:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:34,058 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-14 18:53:34,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:53:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-14 18:53:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:53:34,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:34,059 INFO L402 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-01-14 18:53:34,059 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:34,060 INFO L82 PathProgramCache]: Analyzing trace with hash 564073451, now seen corresponding path program 1 times [2019-01-14 18:53:34,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:34,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:34,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:34,706 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-14 18:53:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:35,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:35,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-14 18:53:35,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:53:35,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:53:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:53:35,234 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 16 states. [2019-01-14 18:53:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:36,454 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-14 18:53:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 18:53:36,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-01-14 18:53:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:36,457 INFO L225 Difference]: With dead ends: 46 [2019-01-14 18:53:36,457 INFO L226 Difference]: Without dead ends: 46 [2019-01-14 18:53:36,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2019-01-14 18:53:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-14 18:53:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-14 18:53:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 18:53:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-14 18:53:36,461 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2019-01-14 18:53:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:36,462 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-14 18:53:36,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:53:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-14 18:53:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:53:36,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:36,465 INFO L402 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] [2019-01-14 18:53:36,465 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1894862360, now seen corresponding path program 1 times [2019-01-14 18:53:36,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:36,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:36,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:36,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-14 18:53:36,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:53:36,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:53:36,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:53:36,919 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 16 states. [2019-01-14 18:53:37,403 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 18:53:37,815 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 18:53:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:38,507 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-14 18:53:38,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 18:53:38,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-14 18:53:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:38,510 INFO L225 Difference]: With dead ends: 45 [2019-01-14 18:53:38,510 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 18:53:38,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-01-14 18:53:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 18:53:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 18:53:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:53:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-14 18:53:38,514 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2019-01-14 18:53:38,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:38,514 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-14 18:53:38,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:53:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-14 18:53:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 18:53:38,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:38,515 INFO L402 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-01-14 18:53:38,516 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1089311954, now seen corresponding path program 1 times [2019-01-14 18:53:38,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:38,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:38,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:38,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:38,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:39,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:39,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-14 18:53:39,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:53:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:53:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:53:39,026 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2019-01-14 18:53:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:39,842 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-14 18:53:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 18:53:39,843 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-01-14 18:53:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:39,844 INFO L225 Difference]: With dead ends: 44 [2019-01-14 18:53:39,844 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 18:53:39,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-01-14 18:53:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 18:53:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-14 18:53:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 18:53:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-14 18:53:39,850 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 33 [2019-01-14 18:53:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:39,851 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-14 18:53:39,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:53:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-14 18:53:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 18:53:39,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:39,854 INFO L402 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, 1] [2019-01-14 18:53:39,854 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 591067884, now seen corresponding path program 1 times [2019-01-14 18:53:39,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:39,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:39,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:39,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:39,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:40,386 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-14 18:53:40,760 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-01-14 18:53:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:41,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:41,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-01-14 18:53:41,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 18:53:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 18:53:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:53:41,061 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 20 states. [2019-01-14 18:53:41,458 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-01-14 18:53:41,640 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-14 18:53:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:42,419 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-14 18:53:42,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 18:53:42,420 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-01-14 18:53:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:42,421 INFO L225 Difference]: With dead ends: 46 [2019-01-14 18:53:42,422 INFO L226 Difference]: Without dead ends: 46 [2019-01-14 18:53:42,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 18:53:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-14 18:53:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-01-14 18:53:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 18:53:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-14 18:53:42,425 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2019-01-14 18:53:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:42,426 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-14 18:53:42,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 18:53:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-14 18:53:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 18:53:42,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:42,427 INFO L402 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, 1] [2019-01-14 18:53:42,427 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 546373601, now seen corresponding path program 1 times [2019-01-14 18:53:42,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:53:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:53:42,512 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:53:42,545 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 18:53:42,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:53:42 BoogieIcfgContainer [2019-01-14 18:53:42,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:53:42,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:53:42,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:53:42,574 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:53:42,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:23" (3/4) ... [2019-01-14 18:53:42,579 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 18:53:42,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:53:42,580 INFO L168 Benchmark]: Toolchain (without parser) took 20855.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.8 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -324.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:42,581 INFO L168 Benchmark]: CDTParser took 1.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:42,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -97.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:42,582 INFO L168 Benchmark]: Boogie Preprocessor took 96.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:42,582 INFO L168 Benchmark]: RCFGBuilder took 884.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 999.3 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:42,584 INFO L168 Benchmark]: TraceAbstraction took 19188.88 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 216.0 MB). Free memory was 999.3 MB in the beginning and 1.3 GB in the end (delta: -277.0 MB). Peak memory consumption was 418.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:42,586 INFO L168 Benchmark]: Witness Printer took 6.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 18:53:42,592 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 674.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -97.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 884.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 999.3 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19188.88 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 216.0 MB). Free memory was 999.3 MB in the beginning and 1.3 GB in the end (delta: -277.0 MB). Peak memory consumption was 418.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={-3:0}] [L643] CALL alloc_data(&data) VAL [pdata={-3:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1:0}, pdata={-3:0}, pdata={-3:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}, pdata->lo={-1:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}, pdata->lo={-1:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}, pdata->hi={1:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}, pdata->hi={1:0}] [L643] RET alloc_data(&data) VAL [data={-3:0}] [L644] CALL free_data(&data) VAL [data={-3:0}] [L632] EXPR data->lo VAL [data={-3:0}, data={-3:0}, data->lo={-1:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={-3:0}, data={-3:0}, data->hi={1:0}, lo={-1:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L639] data->hi = ((void *)0) VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L644] RET free_data(&data) VAL [data={-3:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 74 locations, 31 error locations. UNSAFE Result, 19.1s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 11.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 584 SDtfs, 705 SDslu, 2632 SDs, 0 SdLazy, 3391 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 96862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:53:44,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:53:44,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:53:44,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:53:44,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:53:44,905 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:53:44,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:53:44,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:53:44,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:53:44,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:53:44,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:53:44,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:53:44,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:53:44,915 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:53:44,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:53:44,917 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:53:44,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:53:44,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:53:44,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:53:44,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:53:44,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:53:44,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:53:44,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:53:44,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:53:44,931 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:53:44,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:53:44,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:53:44,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:53:44,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:53:44,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:53:44,937 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:53:44,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:53:44,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:53:44,938 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:53:44,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:53:44,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:53:44,941 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-14 18:53:44,957 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:53:44,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:53:44,959 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:53:44,959 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:53:44,959 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:53:44,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:53:44,960 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:53:44,960 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:53:44,961 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:53:44,961 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:53:44,961 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:53:44,961 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:53:44,961 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:53:44,961 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:53:44,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:53:44,962 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 18:53:44,962 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 18:53:44,962 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:53:44,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:53:44,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:53:44,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:53:44,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:53:44,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:53:44,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:53:44,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:53:44,965 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 18:53:44,965 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:53:44,966 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 18:53:44,966 INFO L133 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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2019-01-14 18:53:45,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:53:45,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:53:45,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:53:45,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:53:45,025 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:53:45,026 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:45,098 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2b66cbf/8f008d4fe15348c9863aef34fbc4b3bb/FLAG98d21aeb9 [2019-01-14 18:53:45,639 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:53:45,641 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:45,661 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2b66cbf/8f008d4fe15348c9863aef34fbc4b3bb/FLAG98d21aeb9 [2019-01-14 18:53:45,894 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2b66cbf/8f008d4fe15348c9863aef34fbc4b3bb [2019-01-14 18:53:45,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:53:45,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:53:45,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:45,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:53:45,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:53:45,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:45" (1/1) ... [2019-01-14 18:53:45,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b45499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:45, skipping insertion in model container [2019-01-14 18:53:45,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:45" (1/1) ... [2019-01-14 18:53:45,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:53:45,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:53:46,298 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:46,314 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:53:46,385 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:46,530 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:53:46,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46 WrapperNode [2019-01-14 18:53:46,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:46,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:53:46,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:53:46,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:53:46,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (1/1) ... [2019-01-14 18:53:46,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (1/1) ... [2019-01-14 18:53:46,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (1/1) ... [2019-01-14 18:53:46,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (1/1) ... [2019-01-14 18:53:46,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (1/1) ... [2019-01-14 18:53:46,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (1/1) ... [2019-01-14 18:53:46,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (1/1) ... [2019-01-14 18:53:46,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:53:46,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:53:46,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:53:46,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:53:46,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (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-01-14 18:53:46,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:53:46,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:53:46,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 18:53:46,664 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-14 18:53:46,665 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-14 18:53:46,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:53:46,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:53:46,665 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:53:46,665 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:53:46,665 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:53:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:53:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:53:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:53:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:53:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:53:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:53:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:53:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:53:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:53:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:53:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:53:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:53:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:53:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:53:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:53:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:53:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:53:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:53:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:53:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:53:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:53:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:53:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:53:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:53:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:53:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:53:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:53:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:53:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:53:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:53:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:53:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:53:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:53:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:53:46,678 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:53:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:53:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:53:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:53:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:53:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:53:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:53:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:53:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:53:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:53:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:53:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:53:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:53:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:53:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:53:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:53:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:53:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:53:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:53:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:53:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:53:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:53:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:53:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:53:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:53:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:53:46,685 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:53:46,685 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:53:46,685 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:53:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:53:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:53:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:53:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:53:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:53:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:53:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:53:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:53:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:53:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:53:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:53:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:53:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:53:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:53:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:53:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:53:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:53:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:53:46,692 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:53:46,693 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:53:46,693 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:53:46,693 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:53:46,694 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:53:46,694 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:53:46,694 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:53:46,694 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:53:46,694 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:53:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:53:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:53:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:53:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:53:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:53:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:53:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:53:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:53:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-14 18:53:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:53:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:53:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:53:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 18:53:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-14 18:53:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 18:53:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:53:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:53:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:53:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:53:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:53:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 18:53:47,684 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:53:47,684 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-14 18:53:47,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:47 BoogieIcfgContainer [2019-01-14 18:53:47,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:53:47,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:53:47,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:53:47,689 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:53:47,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:53:45" (1/3) ... [2019-01-14 18:53:47,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109dda6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:47, skipping insertion in model container [2019-01-14 18:53:47,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:46" (2/3) ... [2019-01-14 18:53:47,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109dda6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:47, skipping insertion in model container [2019-01-14 18:53:47,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:47" (3/3) ... [2019-01-14 18:53:47,693 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2019-01-14 18:53:47,703 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:53:47,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-14 18:53:47,728 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-14 18:53:47,755 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:53:47,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:53:47,756 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:53:47,756 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:53:47,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:53:47,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:53:47,757 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:53:47,757 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:53:47,757 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:53:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-14 18:53:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:47,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:47,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:47,790 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:47,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1156344864, now seen corresponding path program 1 times [2019-01-14 18:53:47,801 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:47,802 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:47,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:47,961 INFO L478 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-01-14 18:53:47,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:47,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:47,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 18:53:48,083 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:53:48,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:48,158 INFO L267 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-01-14 18:53:48,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-14 18:53:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:48,210 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:48,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:48,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:48,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:48,233 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2019-01-14 18:53:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:49,202 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-14 18:53:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:49,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:53:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:49,217 INFO L225 Difference]: With dead ends: 70 [2019-01-14 18:53:49,218 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 18:53:49,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 18:53:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-14 18:53:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 18:53:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-14 18:53:49,268 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2019-01-14 18:53:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:49,268 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-14 18:53:49,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-14 18:53:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:49,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:49,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:49,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:49,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1156344865, now seen corresponding path program 1 times [2019-01-14 18:53:49,273 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:49,273 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:49,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:49,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:49,379 INFO L478 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-01-14 18:53:49,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,462 INFO L478 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-01-14 18:53:49,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 18:53:49,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:49,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:49,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 18:53:49,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:49,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:49,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 18:53:49,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:49,781 INFO L267 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-01-14 18:53:49,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2019-01-14 18:53:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:49,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:49,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:49,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:53:49,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:53:49,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:53:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:49,820 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2019-01-14 18:53:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:50,379 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-14 18:53:50,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:50,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:53:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:50,382 INFO L225 Difference]: With dead ends: 66 [2019-01-14 18:53:50,383 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 18:53:50,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 18:53:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-14 18:53:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 18:53:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-14 18:53:50,393 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 9 [2019-01-14 18:53:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:50,393 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-14 18:53:50,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:53:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-14 18:53:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:53:50,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:50,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:50,395 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1149115710, now seen corresponding path program 1 times [2019-01-14 18:53:50,396 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:50,396 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:50,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:50,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:50,495 INFO L478 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-01-14 18:53:50,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:50,515 INFO L478 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-01-14 18:53:50,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:50,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:50,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 18:53:50,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:50,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:50,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:53:50,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:50,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:50,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 18:53:50,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:50,755 INFO L267 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-01-14 18:53:50,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-14 18:53:50,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:50,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:50,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:53:50,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:50,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:50,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:50,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2019-01-14 18:53:50,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:50,941 INFO L267 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-01-14 18:53:50,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-01-14 18:53:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:50,956 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:50,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:50,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:53:50,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:53:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:53:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:50,960 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 6 states. [2019-01-14 18:53:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:51,404 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-14 18:53:51,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:51,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-14 18:53:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:51,407 INFO L225 Difference]: With dead ends: 63 [2019-01-14 18:53:51,408 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 18:53:51,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:53:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 18:53:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 18:53:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 18:53:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-14 18:53:51,416 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2019-01-14 18:53:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:51,416 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-14 18:53:51,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:53:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-14 18:53:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:53:51,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:51,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:51,418 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:51,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:51,418 INFO L82 PathProgramCache]: Analyzing trace with hash -493603420, now seen corresponding path program 1 times [2019-01-14 18:53:51,419 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:51,419 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:51,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:51,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:51,546 INFO L478 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-01-14 18:53:51,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:53:51,612 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:53:51,625 INFO L478 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 8 treesize of output 7 [2019-01-14 18:53:51,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2019-01-14 18:53:51,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:51,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:51,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:51,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2019-01-14 18:53:51,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:38 [2019-01-14 18:53:51,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 18:53:51,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:51,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2019-01-14 18:53:51,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:51,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2019-01-14 18:53:51,911 INFO L478 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 47 treesize of output 35 [2019-01-14 18:53:51,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2019-01-14 18:53:51,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:51,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:51,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:51,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:27 [2019-01-14 18:53:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:52,111 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:52,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:52,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:53:52,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:53:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:53:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:52,117 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 9 states. [2019-01-14 18:53:52,521 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-01-14 18:53:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:52,935 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-14 18:53:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:53:52,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-01-14 18:53:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:52,938 INFO L225 Difference]: With dead ends: 62 [2019-01-14 18:53:52,938 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 18:53:52,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:53:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 18:53:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-14 18:53:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 18:53:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-14 18:53:52,948 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 13 [2019-01-14 18:53:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:52,948 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-14 18:53:52,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:53:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-14 18:53:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:53:52,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:52,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:52,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:52,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash -493603419, now seen corresponding path program 1 times [2019-01-14 18:53:52,951 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:52,951 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:52,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:53,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:53,083 INFO L478 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-01-14 18:53:53,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,126 INFO L478 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-01-14 18:53:53,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-01-14 18:53:53,195 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:53:53,201 INFO L478 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 8 treesize of output 7 [2019-01-14 18:53:53,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,232 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:53:53,238 INFO L478 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 8 treesize of output 7 [2019-01-14 18:53:53,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2019-01-14 18:53:53,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:53,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:53,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-14 18:53:53,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,359 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 18:53:53,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2019-01-14 18:53:53,426 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-14 18:53:53,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:53,445 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 18:53:53,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,513 INFO L478 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 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-14 18:53:53,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:53,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2019-01-14 18:53:53,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-01-14 18:53:53,606 INFO L478 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 11 [2019-01-14 18:53:53,612 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 18:53:53,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:53,637 INFO L478 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 28 [2019-01-14 18:53:53,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2019-01-14 18:53:53,651 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:53,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:53,677 INFO L267 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-01-14 18:53:53,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2019-01-14 18:53:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:53,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:53,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:53,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:53:53,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:53:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:53:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:53,724 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 9 states. [2019-01-14 18:53:54,163 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-01-14 18:53:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:54,600 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-14 18:53:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:53:54,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-01-14 18:53:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:54,602 INFO L225 Difference]: With dead ends: 61 [2019-01-14 18:53:54,602 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 18:53:54,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:53:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 18:53:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-14 18:53:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 18:53:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-14 18:53:54,608 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 13 [2019-01-14 18:53:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:54,608 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-14 18:53:54,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:53:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-14 18:53:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:53:54,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:54,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:54,609 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1028535326, now seen corresponding path program 1 times [2019-01-14 18:53:54,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:54,610 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:54,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:54,774 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:53:54,778 INFO L478 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 8 treesize of output 7 [2019-01-14 18:53:54,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:54,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:54,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:54,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-01-14 18:53:54,838 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:53:54,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:54,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:54,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:21 [2019-01-14 18:53:54,898 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-14 18:53:54,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:54,910 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 18:53:54,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:54,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:54,966 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 18:53:54,971 INFO L478 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 10 treesize of output 9 [2019-01-14 18:53:54,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:54,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-01-14 18:53:55,039 INFO L478 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 11 [2019-01-14 18:53:55,044 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 18:53:55,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:32 [2019-01-14 18:53:55,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2019-01-14 18:53:55,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:55,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-01-14 18:53:55,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:22 [2019-01-14 18:53:55,263 INFO L478 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 13 [2019-01-14 18:53:55,270 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 18:53:55,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:55,283 INFO L267 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-01-14 18:53:55,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2019-01-14 18:53:55,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-01-14 18:53:55,306 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:55,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:55,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:53:55,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:53:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:53:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:53:55,311 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 11 states. [2019-01-14 18:53:55,473 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 18:53:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:56,403 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-14 18:53:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:53:56,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-14 18:53:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:56,405 INFO L225 Difference]: With dead ends: 60 [2019-01-14 18:53:56,406 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 18:53:56,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:53:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 18:53:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-14 18:53:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 18:53:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-14 18:53:56,412 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 16 [2019-01-14 18:53:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:56,412 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-14 18:53:56,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:53:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-14 18:53:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:53:56,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:56,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:56,414 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1028535327, now seen corresponding path program 1 times [2019-01-14 18:53:56,414 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:56,414 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:56,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:56,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:56,614 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:53:56,622 INFO L478 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 8 treesize of output 7 [2019-01-14 18:53:56,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-14 18:53:56,654 INFO L478 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-01-14 18:53:56,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-01-14 18:53:56,716 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-14 18:53:56,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:56,722 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 18:53:56,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,801 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 18:53:56,804 INFO L478 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 10 treesize of output 9 [2019-01-14 18:53:56,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:56,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2019-01-14 18:53:57,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 83 [2019-01-14 18:53:57,008 INFO L478 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 83 treesize of output 55 [2019-01-14 18:53:57,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:57,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 68 [2019-01-14 18:53:57,129 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:53:57,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 63 treesize of output 73 [2019-01-14 18:53:57,325 INFO L478 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 64 treesize of output 36 [2019-01-14 18:53:57,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:57,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-14 18:53:57,396 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,424 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:53:57,431 INFO L478 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 0 case distinctions, treesize of input 51 treesize of output 40 [2019-01-14 18:53:57,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:57,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-01-14 18:53:57,444 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,480 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:101, output treesize:24 [2019-01-14 18:53:57,542 INFO L478 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 11 [2019-01-14 18:53:57,548 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 18:53:57,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,561 INFO L478 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 13 [2019-01-14 18:53:57,564 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 18:53:57,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:57,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-01-14 18:53:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:57,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:57,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:57,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:53:57,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:53:57,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:53:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:53:57,604 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2019-01-14 18:53:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:58,150 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-14 18:53:58,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:53:58,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-14 18:53:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:58,152 INFO L225 Difference]: With dead ends: 59 [2019-01-14 18:53:58,153 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 18:53:58,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-01-14 18:53:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 18:53:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-14 18:53:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 18:53:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-14 18:53:58,158 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 16 [2019-01-14 18:53:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:58,159 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-14 18:53:58,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:53:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-14 18:53:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:53:58,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:58,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:58,160 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:58,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1937094367, now seen corresponding path program 1 times [2019-01-14 18:53:58,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:58,161 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:58,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:58,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:58,307 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:53:58,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:58,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:58,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-01-14 18:53:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:58,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:58,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:58,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:53:58,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:53:58,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:53:58,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:53:58,370 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 7 states. [2019-01-14 18:53:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:58,821 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-14 18:53:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:53:58,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-01-14 18:53:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:58,823 INFO L225 Difference]: With dead ends: 63 [2019-01-14 18:53:58,824 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 18:53:58,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 18:53:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-01-14 18:53:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 18:53:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-14 18:53:58,830 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 22 [2019-01-14 18:53:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:58,831 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-14 18:53:58,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:53:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-14 18:53:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:53:58,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:58,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:58,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1937094366, now seen corresponding path program 1 times [2019-01-14 18:53:58,833 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:58,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:58,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:59,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:53:59,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:59,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:53:59,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:53:59,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:53:59,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:59,060 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 8 states. [2019-01-14 18:53:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:59,604 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-14 18:53:59,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:53:59,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-14 18:53:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:59,607 INFO L225 Difference]: With dead ends: 53 [2019-01-14 18:53:59,607 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 18:53:59,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:53:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 18:53:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-14 18:53:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 18:53:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-14 18:53:59,615 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 22 [2019-01-14 18:53:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:59,615 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-14 18:53:59,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:53:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-14 18:53:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:53:59,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:59,616 INFO L402 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-01-14 18:53:59,617 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:53:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1041528803, now seen corresponding path program 1 times [2019-01-14 18:53:59,617 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:53:59,618 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:53:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:59,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:59,810 INFO L478 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-01-14 18:53:59,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:53:59,874 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:53:59,878 INFO L478 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 8 treesize of output 7 [2019-01-14 18:53:59,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-14 18:53:59,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:59,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:53:59,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:53:59,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:59,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2019-01-14 18:54:00,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-01-14 18:54:00,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:00,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-14 18:54:00,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-01-14 18:54:00,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 62 [2019-01-14 18:54:00,288 INFO L478 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 60 treesize of output 40 [2019-01-14 18:54:00,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:00,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:00,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:00,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 63 [2019-01-14 18:54:00,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:00,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:00,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:00,733 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:91 [2019-01-14 18:54:01,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2019-01-14 18:54:01,071 INFO L478 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 52 treesize of output 28 [2019-01-14 18:54:01,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:01,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 43 [2019-01-14 18:54:01,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:01,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:54:01,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 62 treesize of output 56 [2019-01-14 18:54:01,518 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:01,518 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 54 treesize of output 48 [2019-01-14 18:54:01,649 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:01,650 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,661 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 18:54:01,721 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:168, output treesize:80 [2019-01-14 18:54:01,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:01,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:01,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-01-14 18:54:01,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:01,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2019-01-14 18:54:02,122 INFO L478 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 33 treesize of output 25 [2019-01-14 18:54:02,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-14 18:54:02,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:02,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:02,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:02,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2019-01-14 18:54:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:02,453 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:02,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:02,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 18:54:02,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:54:02,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:54:02,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:54:02,456 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 17 states. [2019-01-14 18:54:03,336 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-01-14 18:54:04,862 WARN L181 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-01-14 18:54:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:06,358 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-14 18:54:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 18:54:06,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-01-14 18:54:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:06,363 INFO L225 Difference]: With dead ends: 54 [2019-01-14 18:54:06,363 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 18:54:06,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-01-14 18:54:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 18:54:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-14 18:54:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 18:54:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-14 18:54:06,368 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2019-01-14 18:54:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:06,368 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-14 18:54:06,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:54:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-14 18:54:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:54:06,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:06,369 INFO L402 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-01-14 18:54:06,373 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:54:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1041528804, now seen corresponding path program 1 times [2019-01-14 18:54:06,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:06,374 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:54:06,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:06,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:06,575 INFO L478 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-01-14 18:54:06,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:54:06,605 INFO L478 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-01-14 18:54:06,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2019-01-14 18:54:06,670 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:54:06,675 INFO L478 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 8 treesize of output 7 [2019-01-14 18:54:06,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,723 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:54:06,727 INFO L478 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 8 treesize of output 7 [2019-01-14 18:54:06,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:47 [2019-01-14 18:54:06,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:06,835 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 18:54:06,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2019-01-14 18:54:06,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2019-01-14 18:54:06,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:06,950 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 18:54:06,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:06,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2019-01-14 18:54:07,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:07,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:07,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 66 [2019-01-14 18:54:07,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:73 [2019-01-14 18:54:07,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 78 treesize of output 86 [2019-01-14 18:54:07,404 INFO L478 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 79 treesize of output 51 [2019-01-14 18:54:07,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,560 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 50 [2019-01-14 18:54:07,561 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:54:07,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:54:07,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 77 [2019-01-14 18:54:07,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:07,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:07,803 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 79 [2019-01-14 18:54:07,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,828 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:07,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 101 [2019-01-14 18:54:07,910 INFO L478 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 103 treesize of output 75 [2019-01-14 18:54:07,910 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:08,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:08,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:08,087 INFO L478 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 75 [2019-01-14 18:54:08,091 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 18:54:08,215 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 18:54:08,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 18:54:08,330 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:172 [2019-01-14 18:54:08,526 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 18:54:08,712 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 18:54:08,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 112 [2019-01-14 18:54:08,835 INFO L478 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 114 treesize of output 90 [2019-01-14 18:54:08,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:09,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:09,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 87 [2019-01-14 18:54:09,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:09,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:13,132 INFO L478 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 0 case distinctions, treesize of input 105 treesize of output 96 [2019-01-14 18:54:13,138 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:13,138 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:13,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:15,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 136 [2019-01-14 18:54:15,361 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:15,361 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:15,410 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:16,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:16,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 102 treesize of output 106 [2019-01-14 18:54:16,542 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:16,542 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:16,573 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:17,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 80 treesize of output 96 [2019-01-14 18:54:17,703 INFO L478 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 81 treesize of output 57 [2019-01-14 18:54:17,704 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:17,862 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 64 [2019-01-14 18:54:17,863 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2019-01-14 18:54:17,947 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:54:17,955 INFO L478 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 0 case distinctions, treesize of input 67 treesize of output 60 [2019-01-14 18:54:17,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:17,967 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2019-01-14 18:54:17,967 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:18,000 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:18,006 INFO L478 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 0 case distinctions, treesize of input 67 treesize of output 60 [2019-01-14 18:54:18,013 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-01-14 18:54:18,013 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:18,039 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:18,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:18,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 72 treesize of output 76 [2019-01-14 18:54:18,295 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:18,296 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:18,312 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:18,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 18:54:18,446 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:354, output treesize:194 [2019-01-14 18:54:18,857 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-14 18:54:18,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:18,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:18,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:18,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 18:54:18,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:18,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:18,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:229, output treesize:67 [2019-01-14 18:54:19,354 INFO L478 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 11 [2019-01-14 18:54:19,372 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 18:54:19,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:19,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:19,450 INFO L478 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 54 treesize of output 40 [2019-01-14 18:54:19,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2019-01-14 18:54:19,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:19,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:54:19,488 INFO L267 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-01-14 18:54:19,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:18 [2019-01-14 18:54:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:19,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:19,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:19,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 18:54:19,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:54:19,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:54:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:54:19,637 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 17 states. [2019-01-14 18:54:20,409 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-01-14 18:54:20,619 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-14 18:54:23,176 WARN L181 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-01-14 18:54:24,230 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-14 18:54:24,512 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-14 18:54:25,487 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-14 18:54:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:25,667 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-14 18:54:25,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 18:54:25,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-01-14 18:54:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:25,670 INFO L225 Difference]: With dead ends: 52 [2019-01-14 18:54:25,670 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 18:54:25,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-01-14 18:54:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 18:54:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-01-14 18:54:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 18:54:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-14 18:54:25,674 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 26 [2019-01-14 18:54:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:25,675 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-14 18:54:25,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:54:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-14 18:54:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:54:25,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:25,676 INFO L402 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-01-14 18:54:25,676 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:54:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:25,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2072345455, now seen corresponding path program 1 times [2019-01-14 18:54:25,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:25,681 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:54:25,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:25,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:25,899 INFO L478 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-01-14 18:54:25,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:25,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:25,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:54:25,945 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:54:25,948 INFO L478 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 8 treesize of output 7 [2019-01-14 18:54:25,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:25,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:25,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:25,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-14 18:54:25,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:26,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:26,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:54:26,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:26,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:26,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2019-01-14 18:54:26,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-01-14 18:54:26,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:26,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-14 18:54:26,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:26,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:26,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:26,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-01-14 18:54:26,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 55 [2019-01-14 18:54:26,284 INFO L478 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 51 treesize of output 31 [2019-01-14 18:54:26,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:26,400 INFO L478 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 4 case distinctions, treesize of input 37 treesize of output 52 [2019-01-14 18:54:26,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:26,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:26,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:26,520 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2019-01-14 18:54:26,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 60 [2019-01-14 18:54:26,784 INFO L478 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 58 treesize of output 34 [2019-01-14 18:54:26,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:26,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:26,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 55 [2019-01-14 18:54:26,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:26,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:27,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 62 treesize of output 56 [2019-01-14 18:54:27,379 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:27,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:27,391 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:27,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 66 treesize of output 60 [2019-01-14 18:54:27,551 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:27,551 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:27,614 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:27,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 18:54:27,716 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:186, output treesize:129 [2019-01-14 18:54:27,896 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-14 18:54:27,912 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 18:54:27,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:27,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:27,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:27,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-14 18:54:27,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:27,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:27,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:33 [2019-01-14 18:54:28,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2019-01-14 18:54:28,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2019-01-14 18:54:28,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:28,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:28,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:28,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2019-01-14 18:54:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:28,284 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:28,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:28,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 18:54:28,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:54:28,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:54:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:54:28,288 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 17 states. [2019-01-14 18:54:29,241 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-14 18:54:29,599 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-01-14 18:54:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:30,794 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-14 18:54:30,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 18:54:30,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-14 18:54:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:30,797 INFO L225 Difference]: With dead ends: 51 [2019-01-14 18:54:30,797 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 18:54:30,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-01-14 18:54:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 18:54:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-14 18:54:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 18:54:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-14 18:54:30,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2019-01-14 18:54:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:30,805 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-14 18:54:30,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:54:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-14 18:54:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:54:30,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:30,811 INFO L402 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-01-14 18:54:30,811 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:54:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:30,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2072345454, now seen corresponding path program 1 times [2019-01-14 18:54:30,812 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:30,812 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:54:30,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:31,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:31,028 INFO L478 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-01-14 18:54:31,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:54:31,079 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:54:31,099 INFO L478 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 8 treesize of output 7 [2019-01-14 18:54:31,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-14 18:54:31,228 INFO L478 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-01-14 18:54:31,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:31,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:31,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:54:31,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:25 [2019-01-14 18:54:31,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-01-14 18:54:31,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:31,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-14 18:54:31,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:37 [2019-01-14 18:54:31,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 64 [2019-01-14 18:54:31,628 INFO L478 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 62 treesize of output 42 [2019-01-14 18:54:31,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:31,751 INFO L478 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 4 case distinctions, treesize of input 48 treesize of output 59 [2019-01-14 18:54:31,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 18:54:31,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 18:54:31,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 18:54:31,907 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:64, output treesize:101 [2019-01-14 18:54:32,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 153 [2019-01-14 18:54:32,254 INFO L478 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 36 treesize of output 1 [2019-01-14 18:54:32,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:32,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:34,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 163 [2019-01-14 18:54:34,660 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 134 [2019-01-14 18:54:34,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 18:54:35,502 INFO L478 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 150 treesize of output 114 [2019-01-14 18:54:35,503 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:35,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:54:39,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 166 treesize of output 160 [2019-01-14 18:54:39,085 INFO L478 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 36 treesize of output 1 [2019-01-14 18:54:39,085 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:39,136 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:40,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 72 [2019-01-14 18:54:40,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:40,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2019-01-14 18:54:40,721 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:40,765 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:40,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 117 [2019-01-14 18:54:40,860 INFO L478 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 115 treesize of output 79 [2019-01-14 18:54:40,861 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:41,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:41,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 122 [2019-01-14 18:54:41,143 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:41,349 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:41,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 117 treesize of output 111 [2019-01-14 18:54:42,007 INFO L478 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 36 treesize of output 1 [2019-01-14 18:54:42,008 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:42,038 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:42,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 112 [2019-01-14 18:54:42,432 INFO L478 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 36 treesize of output 1 [2019-01-14 18:54:42,432 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:42,464 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:42,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-14 18:54:42,759 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:488, output treesize:335 [2019-01-14 18:54:43,189 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 18:54:43,219 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 18:54:43,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:43,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:43,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:43,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-14 18:54:43,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:43,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:43,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:385, output treesize:78 [2019-01-14 18:54:44,107 INFO L478 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 43 treesize of output 33 [2019-01-14 18:54:44,126 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2019-01-14 18:54:44,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:44,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:44,345 INFO L478 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 44 treesize of output 34 [2019-01-14 18:54:44,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-01-14 18:54:44,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:44,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:44,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:44,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:21 [2019-01-14 18:54:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:44,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:44,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:44,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 18:54:44,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:54:44,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:54:44,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:54:44,655 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2019-01-14 18:54:46,247 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-01-14 18:54:47,520 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-01-14 18:54:48,111 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-14 18:54:48,655 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 18:54:49,099 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 18:54:49,522 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 18:54:50,376 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 18:54:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:50,854 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-14 18:54:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 18:54:50,857 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-14 18:54:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:50,858 INFO L225 Difference]: With dead ends: 49 [2019-01-14 18:54:50,858 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 18:54:50,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2019-01-14 18:54:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 18:54:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-14 18:54:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 18:54:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-14 18:54:50,864 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2019-01-14 18:54:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:50,864 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-14 18:54:50,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:54:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-14 18:54:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:54:50,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:50,866 INFO L402 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] [2019-01-14 18:54:50,866 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:54:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1383512312, now seen corresponding path program 1 times [2019-01-14 18:54:50,867 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:50,867 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:54:50,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:51,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:51,089 INFO L478 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-01-14 18:54:51,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:54:51,152 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:54:51,156 INFO L478 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 8 treesize of output 7 [2019-01-14 18:54:51,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2019-01-14 18:54:51,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:51,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:51,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:54:51,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-01-14 18:54:51,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-14 18:54:51,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:51,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2019-01-14 18:54:51,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:51,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-01-14 18:54:51,615 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-14 18:54:51,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 57 [2019-01-14 18:54:51,840 INFO L478 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 55 treesize of output 35 [2019-01-14 18:54:51,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:52,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:52,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:52,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 59 [2019-01-14 18:54:52,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:52,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:52,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:54:52,313 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:60, output treesize:81 [2019-01-14 18:54:52,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 46 [2019-01-14 18:54:52,620 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:52,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:52,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:52,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 60 treesize of output 54 [2019-01-14 18:54:52,808 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:52,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:52,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:52,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 54 [2019-01-14 18:54:52,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:53,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 41 [2019-01-14 18:54:53,032 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:53,202 INFO L478 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 40 treesize of output 16 [2019-01-14 18:54:53,203 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:53,267 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:54:53,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 18:54:53,335 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:162, output treesize:72 [2019-01-14 18:54:53,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:53,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:53,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-01-14 18:54:53,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:53,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:53,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2019-01-14 18:54:53,724 INFO L478 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 23 [2019-01-14 18:54:53,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2019-01-14 18:54:53,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:53,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:53,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:53,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:3 [2019-01-14 18:54:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:54:53,837 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:54:53,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:54:53,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 18:54:53,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:54:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:54:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:54:53,840 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2019-01-14 18:54:54,533 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-01-14 18:54:54,731 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-01-14 18:54:55,109 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-01-14 18:54:55,552 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-01-14 18:54:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:54:57,173 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-14 18:54:57,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 18:54:57,175 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-14 18:54:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:54:57,176 INFO L225 Difference]: With dead ends: 48 [2019-01-14 18:54:57,176 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 18:54:57,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-01-14 18:54:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 18:54:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-14 18:54:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:54:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-14 18:54:57,191 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2019-01-14 18:54:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:54:57,192 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-14 18:54:57,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:54:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-14 18:54:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 18:54:57,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:54:57,195 INFO L402 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-01-14 18:54:57,195 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:54:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:54:57,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1709023947, now seen corresponding path program 1 times [2019-01-14 18:54:57,200 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:54:57,200 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:54:57,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:54:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:54:57,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:54:57,448 INFO L478 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-01-14 18:54:57,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:54:57,513 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:54:57,517 INFO L478 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 8 treesize of output 7 [2019-01-14 18:54:57,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-14 18:54:57,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:57,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:57,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:54:57,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2019-01-14 18:54:57,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-01-14 18:54:57,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:57,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-14 18:54:57,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:57,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2019-01-14 18:54:57,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 62 [2019-01-14 18:54:58,031 INFO L478 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 48 [2019-01-14 18:54:58,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 18:54:58,226 INFO L478 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 49 treesize of output 29 [2019-01-14 18:54:58,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:58,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 18:54:58,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 18:54:58,400 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:93 [2019-01-14 18:54:58,558 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 18:54:58,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-01-14 18:54:58,798 INFO L478 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 54 treesize of output 30 [2019-01-14 18:54:58,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:58,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:54:58,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2019-01-14 18:54:58,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-14 18:54:59,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:54:59,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 62 treesize of output 56 [2019-01-14 18:54:59,300 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:59,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:59,314 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:59,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 treesize of output 52 [2019-01-14 18:54:59,504 INFO L478 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 24 treesize of output 1 [2019-01-14 18:54:59,504 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:54:59,517 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:54:59,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 18:54:59,611 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:174, output treesize:97 [2019-01-14 18:55:01,821 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 18:55:01,832 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 18:55:01,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:55:01,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:55:01,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:55:01,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-14 18:55:01,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:55:01,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:55:01,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:137, output treesize:31 [2019-01-14 18:55:02,149 INFO L478 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 23 [2019-01-14 18:55:02,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2019-01-14 18:55:02,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:55:02,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:55:02,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:55:02,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:3 [2019-01-14 18:55:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:55:02,274 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:55:02,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:55:02,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 18:55:02,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:55:02,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:55:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=234, Unknown=1, NotChecked=0, Total=272 [2019-01-14 18:55:02,279 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2019-01-14 18:55:14,961 WARN L181 SmtUtils]: Spent 11.70 s on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-01-14 18:55:24,091 WARN L181 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-01-14 18:55:26,617 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 18:55:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:55:28,007 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-14 18:55:28,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 18:55:28,009 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-01-14 18:55:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:55:28,010 INFO L225 Difference]: With dead ends: 47 [2019-01-14 18:55:28,010 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 18:55:28,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=127, Invalid=741, Unknown=2, NotChecked=0, Total=870 [2019-01-14 18:55:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 18:55:28,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-01-14 18:55:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 18:55:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-14 18:55:28,016 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 33 [2019-01-14 18:55:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:55:28,017 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-14 18:55:28,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:55:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-14 18:55:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 18:55:28,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:55:28,018 INFO L402 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, 1] [2019-01-14 18:55:28,018 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:55:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:55:28,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1484828991, now seen corresponding path program 1 times [2019-01-14 18:55:28,019 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:55:28,019 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:55:28,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:55:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:55:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:55:28,652 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:55:28,681 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 18:55:28,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:55:28 BoogieIcfgContainer [2019-01-14 18:55:28,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:55:28,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:55:28,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:55:28,735 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:55:28,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:47" (3/4) ... [2019-01-14 18:55:28,749 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 18:55:28,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:55:28,752 INFO L168 Benchmark]: Toolchain (without parser) took 102852.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.5 MB). Free memory was 946.0 MB in the beginning and 998.2 MB in the end (delta: -52.2 MB). Peak memory consumption was 314.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:55:28,753 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:55:28,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-01-14 18:55:28,754 INFO L168 Benchmark]: Boogie Preprocessor took 75.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 18:55:28,754 INFO L168 Benchmark]: RCFGBuilder took 1076.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-14 18:55:28,754 INFO L168 Benchmark]: TraceAbstraction took 101048.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 287.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:55:28,758 INFO L168 Benchmark]: Witness Printer took 14.39 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 998.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 18:55:28,761 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 630.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1076.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101048.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 287.1 MB. Max. memory is 11.5 GB. * Witness Printer took 14.39 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 998.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. 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: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={-2147483648:0}] [L643] CALL alloc_data(&data) VAL [pdata={-2147483648:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1073741824:0}, pdata={-2147483648:0}, pdata={-2147483648:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1073741824:0}, malloc(sizeof(int))={-1073741821:0}, pdata={-2147483648:0}, pdata={-2147483648:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={-1073741824:0}, malloc(sizeof(int))={-1073741821:0}, pdata={-2147483648:0}, pdata={-2147483648:0}, pdata->lo={-1073741824:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={-1073741824:0}, malloc(sizeof(int))={-1073741821:0}, pdata={-2147483648:0}, pdata={-2147483648:0}, pdata->lo={-1073741824:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={-1073741824:0}, malloc(sizeof(int))={-1073741821:0}, pdata={-2147483648:0}, pdata={-2147483648:0}, pdata->hi={-1073741821:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={-1073741824:0}, malloc(sizeof(int))={-1073741821:0}, pdata={-2147483648:0}, pdata={-2147483648:0}, pdata->hi={-1073741821:0}] [L643] RET alloc_data(&data) VAL [data={-2147483648:0}] [L644] CALL free_data(&data) VAL [data={-2147483648:0}] [L632] EXPR data->lo VAL [data={-2147483648:0}, data={-2147483648:0}, data->lo={-1073741824:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={-2147483648:0}, data={-2147483648:0}, data->hi={-1073741821:0}, lo={-1073741824:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={-2147483648:0}, data={-2147483648:0}, hi={-1073741821:0}, lo={-1073741824:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={-2147483648:0}, data={-2147483648:0}, hi={-1073741821:0}, lo={-1073741824:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={-2147483648:0}, data={-2147483648:0}, hi={-1073741821:0}, lo={-1073741824:0}] [L639] data->hi = ((void *)0) VAL [data={-2147483648:0}, data={-2147483648:0}, hi={-1073741821:0}, lo={-1073741824:0}] [L644] RET free_data(&data) VAL [data={-2147483648:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 31 error locations. UNSAFE Result, 100.9s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 54.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 544 SDtfs, 709 SDslu, 2652 SDs, 0 SdLazy, 3415 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 48.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 43.7s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 285 ConstructedInterpolants, 28 QuantifiedInterpolants, 190768 SizeOfPredicates, 151 NumberOfNonLiveVariables, 1600 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...