./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-13 22:41:53,781 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:41:53,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:41:53,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:41:53,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:41:53,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:41:53,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:41:53,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:41:53,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:41:53,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:41:53,804 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:41:53,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:41:53,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:41:53,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:41:53,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:41:53,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:41:53,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:41:53,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:41:53,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:41:53,815 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:41:53,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:41:53,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:41:53,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:41:53,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:41:53,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:41:53,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:41:53,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:41:53,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:41:53,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:41:53,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:41:53,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:41:53,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:41:53,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:41:53,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:41:53,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:41:53,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:41:53,832 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:41:53,854 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:41:53,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:41:53,856 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:41:53,856 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:41:53,856 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:41:53,856 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:41:53,857 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:41:53,857 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:41:53,858 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:41:53,858 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:41:53,858 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:41:53,858 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:41:53,858 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:41:53,858 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:41:53,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:41:53,859 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:41:53,859 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:41:53,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:41:53,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:41:53,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:41:53,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:41:53,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:41:53,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:41:53,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:41:53,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:41:53,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:41:53,861 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-13 22:41:53,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:41:53,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:41:53,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:41:53,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:41:53,924 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:41:53,925 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-13 22:41:53,982 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6410d4ba/c5e12c6c7ece43f691ef9e465377dc81/FLAG38ce9f9a9 [2019-01-13 22:41:54,441 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:41:54,443 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-13 22:41:54,459 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6410d4ba/c5e12c6c7ece43f691ef9e465377dc81/FLAG38ce9f9a9 [2019-01-13 22:41:54,749 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6410d4ba/c5e12c6c7ece43f691ef9e465377dc81 [2019-01-13 22:41:54,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:41:54,754 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:41:54,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:41:54,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:41:54,759 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:41:54,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:41:54" (1/1) ... [2019-01-13 22:41:54,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af5ab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:54, skipping insertion in model container [2019-01-13 22:41:54,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:41:54" (1/1) ... [2019-01-13 22:41:54,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:41:54,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:41:55,196 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:41:55,214 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:41:55,397 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:41:55,467 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:41:55,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55 WrapperNode [2019-01-13 22:41:55,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:41:55,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:41:55,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:41:55,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:41:55,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (1/1) ... [2019-01-13 22:41:55,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (1/1) ... [2019-01-13 22:41:55,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (1/1) ... [2019-01-13 22:41:55,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (1/1) ... [2019-01-13 22:41:55,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (1/1) ... [2019-01-13 22:41:55,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (1/1) ... [2019-01-13 22:41:55,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (1/1) ... [2019-01-13 22:41:55,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:41:55,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:41:55,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:41:55,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:41:55,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:41:55,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:41:55,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:41:55,623 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-13 22:41:55,623 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-13 22:41:55,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:41:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:41:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:41:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:41:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:41:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:41:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:41:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:41:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:41:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:41:55,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:41:55,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:41:55,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:41:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:41:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:41:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:41:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:41:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:41:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:41:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:41:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:41:55,628 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:41:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:41:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:41:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:41:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:41:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:41:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:41:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:41:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:41:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:41:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:41:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:41:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:41:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:41:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:41:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:41:55,632 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:41:55,632 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:41:55,632 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:41:55,632 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:41:55,632 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:41:55,632 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:41:55,632 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:41:55,632 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:41:55,633 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:41:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:41:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:41:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:41:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:41:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:41:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:41:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:41:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:41:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:41:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:41:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:41:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:41:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:41:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:41:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:41:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:41:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:41:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:41:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:41:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:41:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:41:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:41:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:41:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:41:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:41:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:41:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:41:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:41:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:41:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:41:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:41:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:41:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:41:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:41:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:41:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:41:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:41:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:41:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:41:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:41:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:41:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:41:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:41:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:41:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:41:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:41:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:41:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:41:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:41:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:41:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:41:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:41:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:41:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:41:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:41:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:41:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:41:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-13 22:41:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:41:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:41:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:41:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:41:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-13 22:41:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:41:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:41:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:41:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:41:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:41:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:41:56,328 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:41:56,329 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-13 22:41:56,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:41:56 BoogieIcfgContainer [2019-01-13 22:41:56,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:41:56,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:41:56,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:41:56,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:41:56,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:41:54" (1/3) ... [2019-01-13 22:41:56,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c710aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:41:56, skipping insertion in model container [2019-01-13 22:41:56,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:55" (2/3) ... [2019-01-13 22:41:56,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c710aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:41:56, skipping insertion in model container [2019-01-13 22:41:56,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:41:56" (3/3) ... [2019-01-13 22:41:56,337 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2019-01-13 22:41:56,347 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:41:56,355 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-13 22:41:56,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-13 22:41:56,395 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:41:56,396 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:41:56,396 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:41:56,396 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:41:56,396 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:41:56,396 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:41:56,397 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:41:56,397 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:41:56,397 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:41:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-13 22:41:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:41:56,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:56,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:56,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:41:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:56,435 INFO L82 PathProgramCache]: Analyzing trace with hash -515788903, now seen corresponding path program 1 times [2019-01-13 22:41:56,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:56,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:56,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:56,842 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-13 22:41:56,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:56,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:41:56,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:41:56,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:41:56,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:41:56,861 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2019-01-13 22:41:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:57,282 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-13 22:41:57,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:41:57,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:41:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:57,294 INFO L225 Difference]: With dead ends: 70 [2019-01-13 22:41:57,294 INFO L226 Difference]: Without dead ends: 67 [2019-01-13 22:41:57,296 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-13 22:41:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-13 22:41:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-13 22:41:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-13 22:41:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-13 22:41:57,338 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2019-01-13 22:41:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:57,338 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-13 22:41:57,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:41:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-13 22:41:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:41:57,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:57,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:57,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:41:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash -515788902, now seen corresponding path program 1 times [2019-01-13 22:41:57,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:57,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:57,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:57,571 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 22:41:57,725 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-13 22:41:57,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:57,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:41:57,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:41:57,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:41:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:41:57,728 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2019-01-13 22:41:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:57,994 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-13 22:41:57,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:41:57,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:41:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:57,998 INFO L225 Difference]: With dead ends: 66 [2019-01-13 22:41:57,998 INFO L226 Difference]: Without dead ends: 66 [2019-01-13 22:41:58,001 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-13 22:41:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-13 22:41:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-13 22:41:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-13 22:41:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-13 22:41:58,012 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 9 [2019-01-13 22:41:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:58,013 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-13 22:41:58,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:41:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-13 22:41:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:41:58,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:58,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:58,016 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:41:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1751897317, now seen corresponding path program 1 times [2019-01-13 22:41:58,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:58,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:58,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:58,193 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-13 22:41:58,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:58,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:41:58,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:41:58,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:41:58,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:41:58,196 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 6 states. [2019-01-13 22:41:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:58,395 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-13 22:41:58,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:41:58,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-13 22:41:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:58,398 INFO L225 Difference]: With dead ends: 63 [2019-01-13 22:41:58,398 INFO L226 Difference]: Without dead ends: 63 [2019-01-13 22:41:58,399 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-13 22:41:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-13 22:41:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-13 22:41:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 22:41:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-13 22:41:58,407 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2019-01-13 22:41:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:58,407 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-13 22:41:58,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:41:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-13 22:41:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:41:58,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:58,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:58,408 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:41:58,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:58,409 INFO L82 PathProgramCache]: Analyzing trace with hash 53856989, now seen corresponding path program 1 times [2019-01-13 22:41:58,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:58,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:58,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:58,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:58,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:58,542 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-13 22:41:58,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:58,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:41:58,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:41:58,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:41:58,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:41:58,543 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2019-01-13 22:41:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:58,778 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-13 22:41:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:41:58,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-13 22:41:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:58,781 INFO L225 Difference]: With dead ends: 62 [2019-01-13 22:41:58,781 INFO L226 Difference]: Without dead ends: 62 [2019-01-13 22:41:58,782 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-13 22:41:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-13 22:41:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-13 22:41:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 22:41:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-13 22:41:58,788 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 13 [2019-01-13 22:41:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:58,789 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-13 22:41:58,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:41:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-13 22:41:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:41:58,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:58,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:58,790 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:41:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash 53856990, now seen corresponding path program 1 times [2019-01-13 22:41:58,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:58,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:58,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:58,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:58,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:59,051 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-13 22:41:59,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:59,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:41:59,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:41:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:41:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:41:59,053 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 6 states. [2019-01-13 22:41:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:59,311 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-13 22:41:59,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:41:59,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-13 22:41:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:59,314 INFO L225 Difference]: With dead ends: 61 [2019-01-13 22:41:59,314 INFO L226 Difference]: Without dead ends: 61 [2019-01-13 22:41:59,314 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-13 22:41:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-13 22:41:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-13 22:41:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-13 22:41:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-13 22:41:59,320 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 13 [2019-01-13 22:41:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:59,320 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-13 22:41:59,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:41:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-13 22:41:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:41:59,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:59,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:59,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:41:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1864217314, now seen corresponding path program 1 times [2019-01-13 22:41:59,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:59,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:59,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:59,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:59,691 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-13 22:41:59,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:59,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 22:41:59,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:41:59,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:41:59,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:41:59,693 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 11 states. [2019-01-13 22:42:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:00,179 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-13 22:42:00,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 22:42:00,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-13 22:42:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:00,182 INFO L225 Difference]: With dead ends: 60 [2019-01-13 22:42:00,182 INFO L226 Difference]: Without dead ends: 60 [2019-01-13 22:42:00,183 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-13 22:42:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-13 22:42:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-13 22:42:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-13 22:42:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-13 22:42:00,190 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 16 [2019-01-13 22:42:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:00,190 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-13 22:42:00,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:42:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-13 22:42:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:42:00,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:00,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:00,193 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1864217313, now seen corresponding path program 1 times [2019-01-13 22:42:00,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:00,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:00,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:00,575 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-13 22:42:00,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:00,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 22:42:00,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:42:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:42:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:42:00,576 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2019-01-13 22:42:00,915 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-01-13 22:42:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:01,120 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-13 22:42:01,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 22:42:01,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-13 22:42:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:01,122 INFO L225 Difference]: With dead ends: 59 [2019-01-13 22:42:01,122 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 22:42:01,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:42:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 22:42:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-13 22:42:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-13 22:42:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-13 22:42:01,130 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 16 [2019-01-13 22:42:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:01,130 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-13 22:42:01,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:42:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-13 22:42:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:42:01,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:01,131 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-13 22:42:01,132 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1351600001, now seen corresponding path program 1 times [2019-01-13 22:42:01,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:01,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:01,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:01,238 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-13 22:42:01,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:01,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:42:01,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:42:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:42:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:01,239 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 8 states. [2019-01-13 22:42:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:01,490 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-13 22:42:01,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:01,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-13 22:42:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:01,492 INFO L225 Difference]: With dead ends: 63 [2019-01-13 22:42:01,492 INFO L226 Difference]: Without dead ends: 63 [2019-01-13 22:42:01,493 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-13 22:42:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-13 22:42:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-01-13 22:42:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-13 22:42:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-13 22:42:01,498 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 22 [2019-01-13 22:42:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:01,498 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-13 22:42:01,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:42:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-13 22:42:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:42:01,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:01,499 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-13 22:42:01,500 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1351600002, now seen corresponding path program 1 times [2019-01-13 22:42:01,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:01,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:01,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-13 22:42:01,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:01,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:42:01,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:42:01,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:42:01,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:42:01,714 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 9 states. [2019-01-13 22:42:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:01,857 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-13 22:42:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:01,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-13 22:42:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:01,859 INFO L225 Difference]: With dead ends: 53 [2019-01-13 22:42:01,859 INFO L226 Difference]: Without dead ends: 53 [2019-01-13 22:42:01,860 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-13 22:42:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-13 22:42:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-13 22:42:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-13 22:42:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-13 22:42:01,864 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 22 [2019-01-13 22:42:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:01,864 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-13 22:42:01,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:42:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-13 22:42:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:42:01,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:01,865 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-13 22:42:01,866 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1819311235, now seen corresponding path program 1 times [2019-01-13 22:42:01,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:01,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:01,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:02,242 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-13 22:42:02,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:02,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-13 22:42:02,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:42:02,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:42:02,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:42:02,244 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 16 states. [2019-01-13 22:42:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:03,212 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-13 22:42:03,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 22:42:03,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-01-13 22:42:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:03,216 INFO L225 Difference]: With dead ends: 54 [2019-01-13 22:42:03,216 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 22:42:03,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-01-13 22:42:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 22:42:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-13 22:42:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-13 22:42:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-13 22:42:03,221 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2019-01-13 22:42:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:03,221 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-13 22:42:03,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:42:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-13 22:42:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:42:03,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:03,222 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-13 22:42:03,223 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:03,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:03,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1819311236, now seen corresponding path program 1 times [2019-01-13 22:42:03,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:03,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:03,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:03,897 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-13 22:42:03,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:03,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-13 22:42:03,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:42:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:42:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:42:03,899 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2019-01-13 22:42:04,345 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-13 22:42:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:05,010 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-13 22:42:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 22:42:05,011 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-01-13 22:42:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:05,012 INFO L225 Difference]: With dead ends: 49 [2019-01-13 22:42:05,013 INFO L226 Difference]: Without dead ends: 49 [2019-01-13 22:42:05,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-01-13 22:42:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-13 22:42:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-13 22:42:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-13 22:42:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-13 22:42:05,018 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 26 [2019-01-13 22:42:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:05,019 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-13 22:42:05,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:42:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-13 22:42:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:42:05,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:05,020 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-13 22:42:05,020 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash 564073450, now seen corresponding path program 1 times [2019-01-13 22:42:05,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:05,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:05,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:05,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:05,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:05,541 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-13 22:42:05,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:05,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-13 22:42:05,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:42:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:42:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:42:05,543 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 16 states. [2019-01-13 22:42:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:06,669 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-13 22:42:06,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 22:42:06,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-01-13 22:42:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:06,672 INFO L225 Difference]: With dead ends: 51 [2019-01-13 22:42:06,672 INFO L226 Difference]: Without dead ends: 51 [2019-01-13 22:42:06,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2019-01-13 22:42:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-13 22:42:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-13 22:42:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 22:42:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-13 22:42:06,678 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2019-01-13 22:42:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:06,678 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-13 22:42:06,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:42:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-13 22:42:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:42:06,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:06,679 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-13 22:42:06,679 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash 564073451, now seen corresponding path program 1 times [2019-01-13 22:42:06,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:06,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:06,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:07,309 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-13 22:42:07,505 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-01-13 22:42:07,967 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-13 22:42:07,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:07,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-13 22:42:07,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:42:07,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:42:07,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:42:07,968 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 16 states. [2019-01-13 22:42:08,373 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-13 22:42:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:09,298 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-13 22:42:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 22:42:09,300 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-01-13 22:42:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:09,301 INFO L225 Difference]: With dead ends: 46 [2019-01-13 22:42:09,301 INFO L226 Difference]: Without dead ends: 46 [2019-01-13 22:42:09,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2019-01-13 22:42:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-13 22:42:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-13 22:42:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 22:42:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-13 22:42:09,304 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2019-01-13 22:42:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:09,304 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-13 22:42:09,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:42:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-13 22:42:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:42:09,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:09,306 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-13 22:42:09,307 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1894862360, now seen corresponding path program 1 times [2019-01-13 22:42:09,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:09,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:09,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:09,602 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-13 22:42:09,875 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-13 22:42:09,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:09,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-13 22:42:09,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:42:09,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:42:09,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:42:09,877 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 16 states. [2019-01-13 22:42:10,373 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 22:42:10,806 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 22:42:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:11,456 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-13 22:42:11,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 22:42:11,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-13 22:42:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:11,459 INFO L225 Difference]: With dead ends: 45 [2019-01-13 22:42:11,459 INFO L226 Difference]: Without dead ends: 45 [2019-01-13 22:42:11,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-01-13 22:42:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-13 22:42:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-13 22:42:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 22:42:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-13 22:42:11,462 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2019-01-13 22:42:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:11,469 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-13 22:42:11,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:42:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-13 22:42:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 22:42:11,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:11,470 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-13 22:42:11,470 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1089311954, now seen corresponding path program 1 times [2019-01-13 22:42:11,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:11,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:11,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:11,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:11,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:12,120 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-13 22:42:12,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:12,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-13 22:42:12,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:42:12,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:42:12,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:42:12,122 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2019-01-13 22:42:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:12,818 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-13 22:42:12,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 22:42:12,820 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-01-13 22:42:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:12,821 INFO L225 Difference]: With dead ends: 44 [2019-01-13 22:42:12,821 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 22:42:12,822 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-13 22:42:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 22:42:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 22:42:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 22:42:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-13 22:42:12,827 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 33 [2019-01-13 22:42:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:12,827 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-13 22:42:12,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:42:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-13 22:42:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 22:42:12,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:12,828 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-13 22:42:12,829 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 591067884, now seen corresponding path program 1 times [2019-01-13 22:42:12,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:12,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:12,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:13,268 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-13 22:42:13,629 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-01-13 22:42:13,949 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-13 22:42:13,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:13,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-01-13 22:42:13,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 22:42:13,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 22:42:13,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-13 22:42:13,951 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 20 states. [2019-01-13 22:42:14,333 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-01-13 22:42:14,506 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-13 22:42:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:15,370 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-13 22:42:15,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-13 22:42:15,371 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-01-13 22:42:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:15,373 INFO L225 Difference]: With dead ends: 46 [2019-01-13 22:42:15,373 INFO L226 Difference]: Without dead ends: 46 [2019-01-13 22:42:15,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-01-13 22:42:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-13 22:42:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-01-13 22:42:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 22:42:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-13 22:42:15,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2019-01-13 22:42:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:15,376 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-13 22:42:15,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 22:42:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-13 22:42:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 22:42:15,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:15,377 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-13 22:42:15,377 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:15,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:15,378 INFO L82 PathProgramCache]: Analyzing trace with hash 546373601, now seen corresponding path program 1 times [2019-01-13 22:42:15,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:15,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:15,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:42:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:42:15,437 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:42:15,456 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:42:15,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:42:15 BoogieIcfgContainer [2019-01-13 22:42:15,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:42:15,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:42:15,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:42:15,475 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:42:15,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:41:56" (3/4) ... [2019-01-13 22:42:15,479 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:42:15,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:42:15,480 INFO L168 Benchmark]: Toolchain (without parser) took 20727.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. [2019-01-13 22:42:15,481 INFO L168 Benchmark]: CDTParser took 0.16 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-13 22:42:15,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:42:15,482 INFO L168 Benchmark]: Boogie Preprocessor took 89.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:42:15,483 INFO L168 Benchmark]: RCFGBuilder took 771.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-01-13 22:42:15,484 INFO L168 Benchmark]: TraceAbstraction took 19143.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.0 MB). Peak memory consumption was 125.9 MB. Max. memory is 11.5 GB. [2019-01-13 22:42:15,484 INFO L168 Benchmark]: Witness Printer took 4.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:42:15,489 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.16 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 713.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 771.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19143.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.0 MB). Peak memory consumption was 125.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 11.1s 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.8s 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.2s SatisfiabilityAnalysisTime, 7.1s 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-13 22:42:17,768 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:42:17,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:42:17,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:42:17,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:42:17,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:42:17,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:42:17,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:42:17,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:42:17,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:42:17,799 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:42:17,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:42:17,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:42:17,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:42:17,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:42:17,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:42:17,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:42:17,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:42:17,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:42:17,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:42:17,826 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:42:17,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:42:17,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:42:17,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:42:17,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:42:17,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:42:17,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:42:17,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:42:17,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:42:17,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:42:17,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:42:17,843 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:42:17,844 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:42:17,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:42:17,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:42:17,846 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:42:17,847 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 22:42:17,865 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:42:17,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:42:17,866 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:42:17,866 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:42:17,867 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:42:17,867 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:42:17,867 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:42:17,867 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:42:17,867 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:42:17,868 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:42:17,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:42:17,869 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:42:17,869 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:42:17,869 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:42:17,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:42:17,870 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 22:42:17,870 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 22:42:17,870 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:42:17,871 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:42:17,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:42:17,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:42:17,871 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:42:17,871 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:42:17,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:42:17,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:42:17,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:42:17,874 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 22:42:17,874 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:42:17,874 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 22:42:17,875 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-13 22:42:17,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:42:17,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:42:17,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:42:17,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:42:17,957 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:42:17,958 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-13 22:42:18,021 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303b90b2d/af41eff1520548ae96123bc7b60b5bb1/FLAG95c01212c [2019-01-13 22:42:18,536 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:42:18,536 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-13 22:42:18,552 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303b90b2d/af41eff1520548ae96123bc7b60b5bb1/FLAG95c01212c [2019-01-13 22:42:18,846 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303b90b2d/af41eff1520548ae96123bc7b60b5bb1 [2019-01-13 22:42:18,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:42:18,851 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:42:18,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:42:18,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:42:18,856 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:42:18,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:42:18" (1/1) ... [2019-01-13 22:42:18,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453f9d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:18, skipping insertion in model container [2019-01-13 22:42:18,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:42:18" (1/1) ... [2019-01-13 22:42:18,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:42:18,909 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:42:19,233 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:42:19,249 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:42:19,295 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:42:19,422 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:42:19,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19 WrapperNode [2019-01-13 22:42:19,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:42:19,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:42:19,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:42:19,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:42:19,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (1/1) ... [2019-01-13 22:42:19,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (1/1) ... [2019-01-13 22:42:19,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (1/1) ... [2019-01-13 22:42:19,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (1/1) ... [2019-01-13 22:42:19,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (1/1) ... [2019-01-13 22:42:19,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (1/1) ... [2019-01-13 22:42:19,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (1/1) ... [2019-01-13 22:42:19,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:42:19,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:42:19,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:42:19,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:42:19,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (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-13 22:42:19,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:42:19,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:42:19,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:42:19,583 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-13 22:42:19,583 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-13 22:42:19,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:42:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:42:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:42:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:42:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:42:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:42:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:42:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:42:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:42:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:42:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:42:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:42:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:42:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:42:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:42:19,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:42:19,586 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:42:19,587 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:42:19,587 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:42:19,587 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:42:19,587 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:42:19,587 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:42:19,587 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:42:19,587 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:42:19,588 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:42:19,589 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:42:19,589 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:42:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:42:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:42:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:42:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:42:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:42:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:42:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:42:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:42:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:42:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:42:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:42:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:42:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:42:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:42:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:42:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:42:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:42:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:42:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:42:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:42:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:42:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:42:19,593 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:42:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:42:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:42:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:42:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:42:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:42:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:42:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:42:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:42:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:42:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:42:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:42:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:42:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:42:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:42:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:42:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:42:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:42:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:42:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:42:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:42:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:42:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:42:19,600 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:42:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:42:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:42:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:42:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:42:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:42:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:42:19,603 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:42:19,604 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:42:19,604 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:42:19,604 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:42:19,604 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:42:19,604 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:42:19,604 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:42:19,604 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:42:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-13 22:42:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:42:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:42:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:42:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-13 22:42:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-13 22:42:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-13 22:42:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:42:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:42:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:42:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:42:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:42:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:42:20,434 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:42:20,434 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-13 22:42:20,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:20 BoogieIcfgContainer [2019-01-13 22:42:20,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:42:20,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:42:20,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:42:20,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:42:20,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:42:18" (1/3) ... [2019-01-13 22:42:20,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344cc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:42:20, skipping insertion in model container [2019-01-13 22:42:20,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:19" (2/3) ... [2019-01-13 22:42:20,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344cc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:42:20, skipping insertion in model container [2019-01-13 22:42:20,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:20" (3/3) ... [2019-01-13 22:42:20,443 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2019-01-13 22:42:20,452 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:42:20,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-13 22:42:20,472 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-13 22:42:20,498 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:42:20,499 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:42:20,499 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:42:20,499 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:42:20,499 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:42:20,500 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:42:20,500 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:42:20,500 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:42:20,500 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:42:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-13 22:42:20,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:42:20,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:20,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:20,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1156344864, now seen corresponding path program 1 times [2019-01-13 22:42:20,542 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:20,543 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-13 22:42:20,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:20,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:20,701 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-13 22:42:20,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:20,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:20,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:42:20,765 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-13 22:42:20,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:20,823 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-13 22:42:20,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-13 22:42:20,966 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-13 22:42:20,966 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:20,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:20,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:20,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:42:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:42:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:42:20,996 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2019-01-13 22:42:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:21,943 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-13 22:42:21,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:42:21,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:42:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:21,960 INFO L225 Difference]: With dead ends: 70 [2019-01-13 22:42:21,961 INFO L226 Difference]: Without dead ends: 67 [2019-01-13 22:42:21,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-13 22:42:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-13 22:42:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-13 22:42:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-13 22:42:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-13 22:42:22,022 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2019-01-13 22:42:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:22,022 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-13 22:42:22,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:42:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-13 22:42:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:42:22,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:22,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:22,024 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1156344865, now seen corresponding path program 1 times [2019-01-13 22:42:22,025 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:22,025 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-13 22:42:22,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:22,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:22,104 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-13 22:42:22,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:22,154 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-13 22:42:22,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:22,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:22,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 22:42:22,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:22,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:22,338 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-13 22:42:22,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:22,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:22,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:22,531 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-13 22:42:22,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:22,547 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-13 22:42:22,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2019-01-13 22:42:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:22,568 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:22,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:22,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:22,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:42:22,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:42:22,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:42:22,574 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2019-01-13 22:42:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:23,054 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-13 22:42:23,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:42:23,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:42:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:23,057 INFO L225 Difference]: With dead ends: 66 [2019-01-13 22:42:23,057 INFO L226 Difference]: Without dead ends: 66 [2019-01-13 22:42:23,058 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-13 22:42:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-13 22:42:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-13 22:42:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-13 22:42:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-13 22:42:23,068 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 9 [2019-01-13 22:42:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:23,068 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-13 22:42:23,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:42:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-13 22:42:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:42:23,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:23,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:23,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:23,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:23,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1149115710, now seen corresponding path program 1 times [2019-01-13 22:42:23,071 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:23,071 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-13 22:42:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:23,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:23,183 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-13 22:42:23,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:23,233 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-13 22:42:23,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:23,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:23,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 22:42:23,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:23,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:23,355 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-13 22:42:23,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:23,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:23,381 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-13 22:42:23,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:23,464 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-13 22:42:23,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-13 22:42:23,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:23,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:23,555 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-13 22:42:23,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:23,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:23,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:23,594 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-13 22:42:23,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:23,625 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-13 22:42:23,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-01-13 22:42:23,639 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-13 22:42:23,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:23,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:42:23,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:42:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:42:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:42:23,643 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 6 states. [2019-01-13 22:42:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:24,081 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-13 22:42:24,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:42:24,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-13 22:42:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:24,083 INFO L225 Difference]: With dead ends: 63 [2019-01-13 22:42:24,083 INFO L226 Difference]: Without dead ends: 63 [2019-01-13 22:42:24,084 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-13 22:42:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-13 22:42:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-13 22:42:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 22:42:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-13 22:42:24,092 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2019-01-13 22:42:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:24,093 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-13 22:42:24,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:42:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-13 22:42:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:42:24,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:24,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:24,094 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:24,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash -493603420, now seen corresponding path program 1 times [2019-01-13 22:42:24,095 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:24,095 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-13 22:42:24,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:24,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:24,204 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-13 22:42:24,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:24,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:24,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:42:24,296 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-13 22:42:24,303 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-13 22:42:24,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:24,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:24,324 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-13 22:42:24,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2019-01-13 22:42:24,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:24,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:24,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:24,361 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-13 22:42:24,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:24,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:24,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:38 [2019-01-13 22:42:24,467 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-13 22:42:24,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:24,475 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-13 22:42:24,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:24,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:24,517 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-13 22:42:24,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2019-01-13 22:42:24,569 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-13 22:42:24,573 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-13 22:42:24,575 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-13 22:42:24,588 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-13 22:42:24,603 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-13 22:42:24,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:27 [2019-01-13 22:42:24,787 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-13 22:42:24,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:24,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:24,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:42:24,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:42:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:42:24,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:42:24,794 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 9 states. [2019-01-13 22:42:25,220 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-01-13 22:42:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:25,618 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-13 22:42:25,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:42:25,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-01-13 22:42:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:25,620 INFO L225 Difference]: With dead ends: 62 [2019-01-13 22:42:25,621 INFO L226 Difference]: Without dead ends: 62 [2019-01-13 22:42:25,621 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-13 22:42:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-13 22:42:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-13 22:42:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 22:42:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-13 22:42:25,628 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 13 [2019-01-13 22:42:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:25,629 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-13 22:42:25,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:42:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-13 22:42:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:42:25,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:25,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:25,630 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:25,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:25,631 INFO L82 PathProgramCache]: Analyzing trace with hash -493603419, now seen corresponding path program 1 times [2019-01-13 22:42:25,631 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:25,631 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-13 22:42:25,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:25,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:25,758 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-13 22:42:25,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:25,801 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-13 22:42:25,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:25,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:25,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-01-13 22:42:25,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-13 22:42:25,882 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-13 22:42:25,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:25,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:25,915 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-13 22:42:25,922 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-13 22:42:25,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:25,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:25,949 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-13 22:42:25,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2019-01-13 22:42:26,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:26,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:26,030 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-13 22:42:26,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,054 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-13 22:42:26,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2019-01-13 22:42:26,121 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-13 22:42:26,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:26,138 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-13 22:42:26,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,204 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-13 22:42:26,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:26,211 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-13 22:42:26,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,260 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-13 22:42:26,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-01-13 22:42:26,299 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-13 22:42:26,304 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-13 22:42:26,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,330 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-13 22:42:26,338 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-13 22:42:26,339 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-13 22:42:26,348 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-13 22:42:26,360 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-13 22:42:26,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2019-01-13 22:42:26,439 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-13 22:42:26,439 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:26,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:26,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:42:26,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:42:26,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:42:26,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:42:26,445 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 9 states. [2019-01-13 22:42:26,930 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-01-13 22:42:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:27,393 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-13 22:42:27,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:42:27,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-01-13 22:42:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:27,396 INFO L225 Difference]: With dead ends: 61 [2019-01-13 22:42:27,396 INFO L226 Difference]: Without dead ends: 61 [2019-01-13 22:42:27,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:42:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-13 22:42:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-13 22:42:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-13 22:42:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-13 22:42:27,402 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 13 [2019-01-13 22:42:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:27,403 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-13 22:42:27,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:42:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-13 22:42:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:42:27,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:27,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:27,404 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1028535326, now seen corresponding path program 1 times [2019-01-13 22:42:27,405 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:27,405 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-13 22:42:27,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:27,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:27,555 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-13 22:42:27,558 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-13 22:42:27,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-01-13 22:42:27,616 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-13 22:42:27,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:21 [2019-01-13 22:42:27,678 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-13 22:42:27,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:27,694 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-13 22:42:27,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,745 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-13 22:42:27,750 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-13 22:42:27,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,777 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-13 22:42:27,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-01-13 22:42:27,805 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-13 22:42:27,809 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-13 22:42:27,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:32 [2019-01-13 22:42:27,921 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-13 22:42:27,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:27,944 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-13 22:42:27,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:27,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:22 [2019-01-13 22:42:28,021 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-13 22:42:28,041 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-13 22:42:28,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:28,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:28,096 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-13 22:42:28,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2019-01-13 22:42:28,121 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-13 22:42:28,121 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:28,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:28,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 22:42:28,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:42:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:42:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:42:28,125 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 11 states. [2019-01-13 22:42:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:29,002 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-13 22:42:29,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:42:29,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-13 22:42:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:29,005 INFO L225 Difference]: With dead ends: 60 [2019-01-13 22:42:29,005 INFO L226 Difference]: Without dead ends: 60 [2019-01-13 22:42:29,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:42:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-13 22:42:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-13 22:42:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-13 22:42:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-13 22:42:29,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 16 [2019-01-13 22:42:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:29,010 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-13 22:42:29,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:42:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-13 22:42:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:42:29,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:29,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:29,013 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:29,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1028535327, now seen corresponding path program 1 times [2019-01-13 22:42:29,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:29,013 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-13 22:42:29,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:29,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:29,313 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-13 22:42:29,317 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-13 22:42:29,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 22:42:29,344 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-13 22:42:29,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-01-13 22:42:29,388 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-13 22:42:29,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:29,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, 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-13 22:42:29,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,454 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-13 22:42:29,459 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-13 22:42:29,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,495 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-13 22:42:29,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2019-01-13 22:42:29,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, 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-13 22:42:29,646 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-13 22:42:29,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:29,766 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-13 22:42:29,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:42:29,951 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-13 22:42:29,959 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-13 22:42:29,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:30,033 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-13 22:42:30,034 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:42:30,071 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-13 22:42:30,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:30,079 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-13 22:42:30,080 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,093 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,117 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:101, output treesize:24 [2019-01-13 22:42:30,181 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-13 22:42:30,185 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-13 22:42:30,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,202 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-13 22:42:30,206 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-13 22:42:30,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,217 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-13 22:42:30,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-01-13 22:42:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:30,252 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:30,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:30,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 22:42:30,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:42:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:42:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:42:30,258 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2019-01-13 22:42:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:30,861 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-13 22:42:30,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 22:42:30,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-13 22:42:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:30,863 INFO L225 Difference]: With dead ends: 59 [2019-01-13 22:42:30,864 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 22:42:30,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:42:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 22:42:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-13 22:42:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-13 22:42:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-13 22:42:30,872 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 16 [2019-01-13 22:42:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:30,872 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-13 22:42:30,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:42:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-13 22:42:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:42:30,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:30,874 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-13 22:42:30,874 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1937094367, now seen corresponding path program 1 times [2019-01-13 22:42:30,875 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:30,875 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-13 22:42:30,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:30,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:30,983 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-13 22:42:30,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-01-13 22:42:31,055 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-13 22:42:31,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:31,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:31,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:42:31,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:42:31,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:42:31,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:42:31,066 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 7 states. [2019-01-13 22:42:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:31,529 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-13 22:42:31,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:31,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-01-13 22:42:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:31,532 INFO L225 Difference]: With dead ends: 63 [2019-01-13 22:42:31,532 INFO L226 Difference]: Without dead ends: 63 [2019-01-13 22:42:31,533 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-13 22:42:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-13 22:42:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-01-13 22:42:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-13 22:42:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-13 22:42:31,538 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 22 [2019-01-13 22:42:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:31,539 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-13 22:42:31,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:42:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-13 22:42:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:42:31,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:31,541 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-13 22:42:31,542 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1937094366, now seen corresponding path program 1 times [2019-01-13 22:42:31,542 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:31,542 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-13 22:42:31,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:31,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:31,752 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-13 22:42:31,752 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:31,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:31,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:42:31,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:42:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:42:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:31,756 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 8 states. [2019-01-13 22:42:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:32,297 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-13 22:42:32,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:32,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-13 22:42:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:32,300 INFO L225 Difference]: With dead ends: 53 [2019-01-13 22:42:32,300 INFO L226 Difference]: Without dead ends: 53 [2019-01-13 22:42:32,300 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-13 22:42:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-13 22:42:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-13 22:42:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-13 22:42:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-13 22:42:32,306 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 22 [2019-01-13 22:42:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:32,306 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-13 22:42:32,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:42:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-13 22:42:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:42:32,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:32,307 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-13 22:42:32,310 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1041528803, now seen corresponding path program 1 times [2019-01-13 22:42:32,312 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:32,312 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-13 22:42:32,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:32,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:32,503 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-13 22:42:32,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:42:32,574 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-13 22:42:32,577 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-13 22:42:32,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,602 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-13 22:42:32,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-13 22:42:32,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:32,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:32,654 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-13 22:42:32,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2019-01-13 22:42:32,704 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-13 22:42:32,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:32,774 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-13 22:42:32,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,994 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-13 22:42:32,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-01-13 22:42:33,158 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-13 22:42:33,179 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-13 22:42:33,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:33,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:33,433 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-13 22:42:33,437 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 22:42:33,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 22:42:33,629 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-13 22:42:33,629 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:91 [2019-01-13 22:42:33,914 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-13 22:42:33,937 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-13 22:42:33,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:34,202 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-13 22:42:34,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 22:42:34,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:42:34,463 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-13 22:42:34,467 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-13 22:42:34,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,478 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,604 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-13 22:42:34,610 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-13 22:42:34,610 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,674 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-13 22:42:34,674 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:168, output treesize:80 [2019-01-13 22:42:34,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:34,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:34,922 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-13 22:42:34,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2019-01-13 22:42:35,129 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-13 22:42:35,132 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-13 22:42:35,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,146 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-13 22:42:35,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2019-01-13 22:42:35,217 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-13 22:42:35,217 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (11)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 22:42:35,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:35,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 22:42:35,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:42:35,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:42:35,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:42:35,221 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 17 states. [2019-01-13 22:42:36,119 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-01-13 22:42:36,672 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-01-13 22:42:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:38,312 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-13 22:42:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 22:42:38,314 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-01-13 22:42:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:38,318 INFO L225 Difference]: With dead ends: 54 [2019-01-13 22:42:38,318 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 22:42:38,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-01-13 22:42:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 22:42:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-13 22:42:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-13 22:42:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-13 22:42:38,326 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2019-01-13 22:42:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:38,327 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-13 22:42:38,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:42:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-13 22:42:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:42:38,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:38,332 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-13 22:42:38,332 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1041528804, now seen corresponding path program 1 times [2019-01-13 22:42:38,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:38,333 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-13 22:42:38,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:38,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:38,536 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-13 22:42:38,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:42:38,566 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-13 22:42:38,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2019-01-13 22:42:38,635 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-13 22:42:38,640 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-13 22:42:38,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,688 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-13 22:42:38,691 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-13 22:42:38,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,727 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-13 22:42:38,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:47 [2019-01-13 22:42:38,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:38,779 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-13 22:42:38,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2019-01-13 22:42:38,890 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-13 22:42:38,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:38,901 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-13 22:42:38,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:38,994 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-13 22:42:39,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:39,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:39,005 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-13 22:42:39,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:39,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:39,091 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-13 22:42:39,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:73 [2019-01-13 22:42:39,328 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-13 22:42:39,346 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-13 22:42:39,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:39,506 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-13 22:42:39,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 22:42:39,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:42:39,714 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-13 22:42:39,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:39,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:39,741 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-13 22:42:39,741 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:39,780 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:39,842 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-13 22:42:39,862 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-13 22:42:39,863 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:40,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:40,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:40,052 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-13 22:42:40,056 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-13 22:42:40,197 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-13 22:42:40,314 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-13 22:42:40,315 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:172 [2019-01-13 22:42:40,493 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-13 22:42:40,691 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-13 22:42:40,789 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-13 22:42:40,796 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-13 22:42:40,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:41,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:41,129 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-13 22:42:41,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 22:42:41,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 22:42:44,977 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-13 22:42:44,984 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-13 22:42:44,984 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:45,020 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:47,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:47,212 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-13 22:42:47,219 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-13 22:42:47,219 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:47,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:48,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:48,593 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-13 22:42:48,599 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-13 22:42:48,600 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:48,628 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:49,375 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-13 22:42:49,382 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-13 22:42:49,382 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:49,542 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-13 22:42:49,543 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2019-01-13 22:42:49,959 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:42:49,968 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-13 22:42:49,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:49,979 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-13 22:42:49,979 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:50,012 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:50,019 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-13 22:42:50,026 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-13 22:42:50,026 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:50,055 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:50,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:50,322 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-13 22:42:50,327 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-13 22:42:50,327 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:50,345 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:50,482 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-13 22:42:50,482 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:354, output treesize:194 [2019-01-13 22:42:50,931 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-13 22:42:51,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:51,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:51,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:51,046 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-13 22:42:51,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:51,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:51,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:229, output treesize:67 [2019-01-13 22:42:51,442 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-13 22:42:51,459 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-13 22:42:51,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:51,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:51,554 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-13 22:42:51,560 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-13 22:42:51,561 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-13 22:42:51,578 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-13 22:42:51,596 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-13 22:42:51,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:18 [2019-01-13 22:42:51,742 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-13 22:42:51,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:51,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:51,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 22:42:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:42:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:42:51,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:42:51,746 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 17 states. [2019-01-13 22:42:52,518 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-01-13 22:42:52,742 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-13 22:42:54,644 WARN L181 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-01-13 22:42:55,681 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-13 22:42:55,944 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-13 22:42:56,923 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-13 22:42:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:57,096 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-13 22:42:57,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 22:42:57,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-01-13 22:42:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:57,099 INFO L225 Difference]: With dead ends: 52 [2019-01-13 22:42:57,099 INFO L226 Difference]: Without dead ends: 52 [2019-01-13 22:42:57,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-01-13 22:42:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-13 22:42:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-01-13 22:42:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-13 22:42:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-13 22:42:57,103 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 26 [2019-01-13 22:42:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:57,103 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-13 22:42:57,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:42:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-13 22:42:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:42:57,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:57,107 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-13 22:42:57,107 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:42:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2072345455, now seen corresponding path program 1 times [2019-01-13 22:42:57,108 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:57,108 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-13 22:42:57,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:57,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:57,326 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-13 22:42:57,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:42:57,379 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-13 22:42:57,385 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-13 22:42:57,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,405 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-13 22:42:57,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-13 22:42:57,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:57,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:57,436 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-13 22:42:57,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2019-01-13 22:42:57,486 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-13 22:42:57,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:57,497 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-13 22:42:57,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,535 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-13 22:42:57,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-01-13 22:42:57,723 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-13 22:42:57,730 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-13 22:42:57,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:57,834 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-13 22:42:57,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 22:42:57,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 22:42:57,947 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-13 22:42:57,947 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2019-01-13 22:42:58,255 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-13 22:42:58,262 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-13 22:42:58,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:58,387 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-13 22:42:58,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 22:42:58,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 22:42:58,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, 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-13 22:42:58,793 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-13 22:42:58,793 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,965 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-13 22:42:58,970 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-13 22:42:58,970 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,030 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,126 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-13 22:42:59,126 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:186, output treesize:129 [2019-01-13 22:42:59,306 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-13 22:42:59,315 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-13 22:42:59,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:59,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:59,348 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-13 22:42:59,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:33 [2019-01-13 22:42:59,567 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-13 22:42:59,607 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-13 22:42:59,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,616 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-13 22:42:59,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2019-01-13 22:42:59,693 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-13 22:42:59,693 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:59,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:59,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 22:42:59,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:42:59,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:42:59,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:42:59,696 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 17 states. [2019-01-13 22:43:00,687 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-13 22:43:01,330 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-01-13 22:43:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:43:02,544 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-13 22:43:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 22:43:02,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-13 22:43:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:43:02,547 INFO L225 Difference]: With dead ends: 51 [2019-01-13 22:43:02,547 INFO L226 Difference]: Without dead ends: 51 [2019-01-13 22:43:02,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-01-13 22:43:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-13 22:43:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-13 22:43:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 22:43:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-13 22:43:02,551 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2019-01-13 22:43:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:43:02,552 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-13 22:43:02,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:43:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-13 22:43:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:43:02,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:43:02,553 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-13 22:43:02,553 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:43:02,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:43:02,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2072345454, now seen corresponding path program 1 times [2019-01-13 22:43:02,554 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:43:02,554 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-13 22:43:02,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:43:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:43:02,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:43:02,775 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-13 22:43:02,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:02,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:02,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:43:02,825 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-13 22:43:02,830 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-13 22:43:02,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:02,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:02,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-13 22:43:02,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-13 22:43:02,978 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-13 22:43:02,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:03,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:03,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:03,101 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-13 22:43:03,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:03,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:03,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:25 [2019-01-13 22:43:03,165 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-13 22:43:03,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:03,172 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-13 22:43:03,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:03,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:03,215 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-13 22:43:03,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:37 [2019-01-13 22:43:03,392 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-13 22:43:03,400 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-13 22:43:03,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:03,519 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-13 22:43:03,522 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-13 22:43:03,605 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-13 22:43:03,679 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-13 22:43:03,679 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:64, output treesize:101 [2019-01-13 22:43:04,010 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-13 22:43:04,031 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-13 22:43:04,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:04,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:06,153 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-13 22:43:06,249 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-13 22:43:06,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 22:43:07,104 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-13 22:43:07,105 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:07,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:43:10,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 160 [2019-01-13 22:43:10,309 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-13 22:43:10,309 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:10,362 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:11,761 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-13 22:43:11,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:11,781 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-13 22:43:11,781 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:11,827 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:11,920 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-13 22:43:11,928 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-13 22:43:11,929 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:12,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:12,245 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-13 22:43:12,247 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-13 22:43:12,460 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 22:43:13,134 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-13 22:43:13,143 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-13 22:43:13,143 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:13,177 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:13,607 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-13 22:43:13,614 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-13 22:43:13,615 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:13,648 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:13,929 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-13 22:43:13,931 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:488, output treesize:335 [2019-01-13 22:43:14,382 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-13 22:43:14,401 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-13 22:43:14,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:14,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:14,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:14,520 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-13 22:43:14,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:14,732 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-13 22:43:14,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:385, output treesize:78 [2019-01-13 22:43:15,278 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-13 22:43:15,296 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-13 22:43:15,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:15,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:15,535 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-13 22:43:15,543 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-13 22:43:15,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:15,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:15,585 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-13 22:43:15,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:21 [2019-01-13 22:43:15,859 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-13 22:43:15,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:43:15,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:43:15,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 22:43:15,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:43:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:43:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:43:15,865 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2019-01-13 22:43:19,468 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-01-13 22:43:20,408 WARN L181 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-01-13 22:43:21,000 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-13 22:43:21,532 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-13 22:43:21,978 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-13 22:43:22,407 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-13 22:43:23,271 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-13 22:43:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:43:23,749 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-13 22:43:23,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 22:43:23,751 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-13 22:43:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:43:23,752 INFO L225 Difference]: With dead ends: 49 [2019-01-13 22:43:23,752 INFO L226 Difference]: Without dead ends: 49 [2019-01-13 22:43:23,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2019-01-13 22:43:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-13 22:43:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-13 22:43:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 22:43:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-13 22:43:23,756 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2019-01-13 22:43:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:43:23,756 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-13 22:43:23,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:43:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-13 22:43:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:43:23,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:43:23,758 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-13 22:43:23,758 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:43:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:43:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1383512312, now seen corresponding path program 1 times [2019-01-13 22:43:23,759 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:43:23,759 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-13 22:43:23,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:43:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:43:23,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:43:23,980 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-13 22:43:23,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:23,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:23,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:43:24,047 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-13 22:43:24,050 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-13 22:43:24,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:24,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:24,082 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-13 22:43:24,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2019-01-13 22:43:24,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:24,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:24,121 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-13 22:43:24,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:24,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:24,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-01-13 22:43:24,195 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-13 22:43:24,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:24,206 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-13 22:43:24,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:24,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:24,260 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-13 22:43:24,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-01-13 22:43:24,504 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-13 22:43:24,709 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-13 22:43:24,726 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-13 22:43:24,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:24,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:24,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:25,026 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-13 22:43:25,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 22:43:25,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 22:43:25,185 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-13 22:43:25,185 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:60, output treesize:81 [2019-01-13 22:43:25,499 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-13 22:43:25,513 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-13 22:43:25,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:25,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:25,703 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-13 22:43:25,710 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-13 22:43:25,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:25,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:25,883 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-13 22:43:25,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:26,033 INFO L303 Elim1Store]: Index analysis took 145 ms [2019-01-13 22:43:26,277 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-13 22:43:26,278 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2019-01-13 22:43:26,560 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-13 22:43:26,561 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:26,615 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:43:26,679 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-13 22:43:26,679 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:162, output treesize:72 [2019-01-13 22:43:26,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:26,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:26,995 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-13 22:43:26,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:27,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:27,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2019-01-13 22:43:27,223 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-13 22:43:27,228 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-13 22:43:27,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:27,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:27,302 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-13 22:43:27,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:3 [2019-01-13 22:43:27,387 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-13 22:43:27,387 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:43:27,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:43:27,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 22:43:27,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:43:27,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:43:27,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:43:27,391 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2019-01-13 22:43:28,239 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-01-13 22:43:28,577 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-01-13 22:43:29,003 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-01-13 22:43:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:43:30,562 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-13 22:43:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 22:43:30,564 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-13 22:43:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:43:30,565 INFO L225 Difference]: With dead ends: 48 [2019-01-13 22:43:30,565 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 22:43:30,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-01-13 22:43:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 22:43:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-13 22:43:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 22:43:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-13 22:43:30,575 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2019-01-13 22:43:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:43:30,581 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-13 22:43:30,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:43:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-13 22:43:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 22:43:30,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:43:30,582 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-13 22:43:30,582 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:43:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:43:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1709023947, now seen corresponding path program 1 times [2019-01-13 22:43:30,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:43:30,586 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-13 22:43:30,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:43:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:43:30,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:43:30,817 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-13 22:43:30,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:30,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:30,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:43:30,886 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-13 22:43:30,890 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-13 22:43:30,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:30,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:30,908 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-13 22:43:30,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-13 22:43:30,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:30,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:30,949 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-13 22:43:30,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:30,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:30,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2019-01-13 22:43:31,045 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-13 22:43:31,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:31,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 18 treesize of output 25 [2019-01-13 22:43:31,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:31,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:31,101 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-13 22:43:31,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2019-01-13 22:43:31,303 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-13 22:43:31,361 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-13 22:43:31,363 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-13 22:43:31,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 49 treesize of output 29 [2019-01-13 22:43:31,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:31,631 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-13 22:43:31,709 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-13 22:43:31,710 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:93 [2019-01-13 22:43:31,863 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-13 22:43:32,016 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-13 22:43:32,102 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-13 22:43:32,108 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-13 22:43:32,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:32,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:32,250 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-13 22:43:32,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 22:43:32,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:43:32,575 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-13 22:43:32,580 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-13 22:43:32,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:32,594 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:32,771 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-13 22:43:32,777 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-13 22:43:32,777 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:32,792 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:32,874 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-13 22:43:32,874 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:174, output treesize:97 [2019-01-13 22:43:35,094 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-13 22:43:35,105 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-13 22:43:35,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:35,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:35,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:43:35,146 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-13 22:43:35,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:35,192 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-13 22:43:35,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:137, output treesize:31 [2019-01-13 22:43:35,419 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-13 22:43:35,430 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-13 22:43:35,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:43:35,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:43:35,445 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-13 22:43:35,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:3 [2019-01-13 22:43:35,537 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-13 22:43:35,538 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (16)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 22:43:35,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:43:35,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 22:43:35,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:43:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:43:35,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=234, Unknown=1, NotChecked=0, Total=272 [2019-01-13 22:43:35,546 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2019-01-13 22:43:45,880 WARN L181 SmtUtils]: Spent 9.35 s on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-01-13 22:43:55,036 WARN L181 SmtUtils]: Spent 9.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-01-13 22:43:57,731 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-13 22:43:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:43:59,082 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-13 22:43:59,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 22:43:59,084 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-01-13 22:43:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:43:59,085 INFO L225 Difference]: With dead ends: 47 [2019-01-13 22:43:59,085 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 22:43:59,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=127, Invalid=741, Unknown=2, NotChecked=0, Total=870 [2019-01-13 22:43:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 22:43:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-01-13 22:43:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 22:43:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-13 22:43:59,092 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 33 [2019-01-13 22:43:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:43:59,092 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-13 22:43:59,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:43:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-13 22:43:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 22:43:59,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:43:59,093 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-13 22:43:59,094 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 22:43:59,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:43:59,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1484828991, now seen corresponding path program 1 times [2019-01-13 22:43:59,094 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:43:59,094 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-13 22:43:59,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:43:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:43:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:43:59,726 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:43:59,756 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:43:59,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:43:59 BoogieIcfgContainer [2019-01-13 22:43:59,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:43:59,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:43:59,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:43:59,792 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:43:59,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:20" (3/4) ... [2019-01-13 22:43:59,802 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:43:59,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:43:59,803 INFO L168 Benchmark]: Toolchain (without parser) took 100953.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.7 MB). Free memory was 952.7 MB in the beginning and 974.0 MB in the end (delta: -21.3 MB). Peak memory consumption was 339.4 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:59,804 INFO L168 Benchmark]: CDTParser took 0.16 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-13 22:43:59,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:59,805 INFO L168 Benchmark]: Boogie Preprocessor took 88.65 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:59,805 INFO L168 Benchmark]: RCFGBuilder took 920.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:59,805 INFO L168 Benchmark]: TraceAbstraction took 99355.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.7 MB). Free memory was 1.1 GB in the beginning and 974.0 MB in the end (delta: 101.0 MB). Peak memory consumption was 320.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:59,805 INFO L168 Benchmark]: Witness Printer took 10.20 ms. Allocated memory is still 1.4 GB. Free memory is still 974.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:43:59,807 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.16 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 574.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.65 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 920.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 99355.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.7 MB). Free memory was 1.1 GB in the beginning and 974.0 MB in the end (delta: 101.0 MB). Peak memory consumption was 320.7 MB. Max. memory is 11.5 GB. * Witness Printer took 10.20 ms. Allocated memory is still 1.4 GB. Free memory is still 974.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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))={-1073741821:0}, malloc(sizeof(int))={-1073741824:0}, pdata={-2147483648:0}, pdata={-2147483648:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={-1073741821:0}, malloc(sizeof(int))={-1073741824:0}, pdata={-2147483648:0}, pdata={-2147483648:0}, pdata->lo={-1073741824:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={-1073741821:0}, malloc(sizeof(int))={-1073741824:0}, pdata={-2147483648:0}, pdata={-2147483648:0}, pdata->lo={-1073741824:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={-1073741821:0}, malloc(sizeof(int))={-1073741824:0}, pdata={-2147483648:0}, pdata={-2147483648:0}, pdata->hi={-1073741821:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={-1073741821:0}, malloc(sizeof(int))={-1073741824: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, 99.3s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 52.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 544 SDtfs, 709 SDslu, 2652 SDs, 0 SdLazy, 3414 SolverSat, 190 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 45.3s 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.7s SatisfiabilityAnalysisTime, 44.1s 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...