./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/test-0019_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa 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/memsafety/test-0019_true-valid-memsafety_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 cb3a1029b311511a929aa1b20bb93012329001e7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:28:23,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:28:23,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:28:24,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:28:24,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:28:24,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:28:24,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:28:24,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:28:24,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:28:24,013 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:28:24,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:28:24,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:28:24,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:28:24,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:28:24,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:28:24,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:28:24,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:28:24,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:28:24,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:28:24,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:28:24,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:28:24,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:28:24,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:28:24,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:28:24,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:28:24,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:28:24,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:28:24,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:28:24,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:28:24,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:28:24,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:28:24,058 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:28:24,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:28:24,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:28:24,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:28:24,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:28:24,060 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:28:24,075 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:28:24,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:28:24,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:28:24,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:28:24,076 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:28:24,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:28:24,077 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:28:24,077 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:28:24,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:28:24,077 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:28:24,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:28:24,078 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:28:24,078 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:28:24,078 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:28:24,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:28:24,078 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:28:24,079 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:28:24,080 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:28:24,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:28:24,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:28:24,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:28:24,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:28:24,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:28:24,082 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:28:24,082 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:28:24,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:28:24,083 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 -> cb3a1029b311511a929aa1b20bb93012329001e7 [2019-01-01 17:28:24,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:28:24,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:28:24,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:28:24,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:28:24,166 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:28:24,167 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0019_true-valid-memsafety_true-termination.i [2019-01-01 17:28:24,229 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4744ae5ed/0c343988e0ec4fa8a937f8cd416cf384/FLAG8e7fe562d [2019-01-01 17:28:24,847 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:28:24,848 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0019_true-valid-memsafety_true-termination.i [2019-01-01 17:28:24,861 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4744ae5ed/0c343988e0ec4fa8a937f8cd416cf384/FLAG8e7fe562d [2019-01-01 17:28:25,043 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4744ae5ed/0c343988e0ec4fa8a937f8cd416cf384 [2019-01-01 17:28:25,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:28:25,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:28:25,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:28:25,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:28:25,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:28:25,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c1da83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25, skipping insertion in model container [2019-01-01 17:28:25,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:28:25,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:28:25,493 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:28:25,509 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:28:25,590 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:28:25,746 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:28:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25 WrapperNode [2019-01-01 17:28:25,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:28:25,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:28:25,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:28:25,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:28:25,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (1/1) ... [2019-01-01 17:28:25,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:28:25,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:28:25,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:28:25,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:28:25,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (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-01 17:28:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:28:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:28:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-01 17:28:25,904 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-01 17:28:25,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:28:25,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:28:25,904 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:28:25,904 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:28:25,905 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:28:25,905 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:28:25,905 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:28:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:28:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:28:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:28:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:28:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:28:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:28:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:28:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:28:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:28:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:28:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:28:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:28:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:28:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:28:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:28:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:28:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:28:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:28:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:28:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:28:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:28:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:28:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:28:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:28:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:28:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:28:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:28:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:28:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:28:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:28:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:28:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:28:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:28:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:28:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:28:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:28:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:28:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:28:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:28:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:28:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:28:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:28:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:28:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:28:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:28:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:28:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:28:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:28:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:28:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:28:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:28:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:28:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:28:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:28:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:28:25,917 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:28:25,917 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:28:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:28:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:28:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 17:28:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:28:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:28:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:28:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:28:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:28:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:28:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:28:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:28:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:28:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:28:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:28:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:28:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:28:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:28:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:28:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:28:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:28:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:28:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:28:25,922 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:28:25,923 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:28:25,923 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:28:25,923 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:28:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:28:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:28:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:28:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:28:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:28:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:28:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:28:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:28:25,925 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:28:25,925 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:28:25,925 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:28:25,925 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:28:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:28:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-01 17:28:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:28:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:28:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-01 17:28:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:28:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:28:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:28:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:28:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:28:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:28:26,786 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:28:26,786 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-01 17:28:26,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:28:26 BoogieIcfgContainer [2019-01-01 17:28:26,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:28:26,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:28:26,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:28:26,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:28:26,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:28:25" (1/3) ... [2019-01-01 17:28:26,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25075745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:28:26, skipping insertion in model container [2019-01-01 17:28:26,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:28:25" (2/3) ... [2019-01-01 17:28:26,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25075745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:28:26, skipping insertion in model container [2019-01-01 17:28:26,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:28:26" (3/3) ... [2019-01-01 17:28:26,798 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2019-01-01 17:28:26,809 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:28:26,816 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-01-01 17:28:26,831 INFO L257 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-01-01 17:28:26,858 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:28:26,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:28:26,859 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:28:26,859 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:28:26,860 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:28:26,860 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:28:26,860 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:28:26,860 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:28:26,860 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:28:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-01-01 17:28:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:28:26,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:26,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:28:26,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2134146503, now seen corresponding path program 1 times [2019-01-01 17:28:26,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:26,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:26,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:26,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:26,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:27,233 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-01 17:28:27,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:27,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:28:27,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:28:27,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:28:27,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:28:27,257 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 5 states. [2019-01-01 17:28:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:27,710 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-01 17:28:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:28:27,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:28:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:27,726 INFO L225 Difference]: With dead ends: 56 [2019-01-01 17:28:27,726 INFO L226 Difference]: Without dead ends: 53 [2019-01-01 17:28:27,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01 17:28:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-01 17:28:27,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-01 17:28:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 17:28:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-01 17:28:27,772 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 9 [2019-01-01 17:28:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:27,773 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-01 17:28:27,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:28:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-01 17:28:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:28:27,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:27,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:28:27,775 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:27,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:27,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2134146502, now seen corresponding path program 1 times [2019-01-01 17:28:27,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:27,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:27,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:27,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:27,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:27,902 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-01 17:28:27,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:27,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:28:27,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:28:27,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:28:27,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:28:27,905 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 5 states. [2019-01-01 17:28:28,111 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 17:28:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:28,456 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-01 17:28:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:28:28,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:28:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:28,461 INFO L225 Difference]: With dead ends: 50 [2019-01-01 17:28:28,461 INFO L226 Difference]: Without dead ends: 50 [2019-01-01 17:28:28,462 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-01 17:28:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-01 17:28:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-01 17:28:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 17:28:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-01 17:28:28,469 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 9 [2019-01-01 17:28:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:28,469 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-01 17:28:28,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:28:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-01 17:28:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:28:28,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:28,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:28:28,471 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2079577723, now seen corresponding path program 1 times [2019-01-01 17:28:28,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:28,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:28,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:28,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:28,678 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-01 17:28:28,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:28,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:28:28,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:28:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:28:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:28:28,680 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 6 states. [2019-01-01 17:28:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:28,866 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-01 17:28:28,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:28:28,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-01 17:28:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:28,871 INFO L225 Difference]: With dead ends: 49 [2019-01-01 17:28:28,871 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 17:28:28,871 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-01 17:28:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 17:28:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-01 17:28:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 17:28:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-01 17:28:28,879 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2019-01-01 17:28:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:28,880 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-01 17:28:28,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:28:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-01 17:28:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:28:28,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:28,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:28:28,881 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash 38868061, now seen corresponding path program 1 times [2019-01-01 17:28:28,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:28,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:28,946 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-01 17:28:28,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:28,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:28:28,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:28:28,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:28:28,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:28:28,948 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 3 states. [2019-01-01 17:28:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:29,038 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-01 17:28:29,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:28:29,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-01 17:28:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:29,041 INFO L225 Difference]: With dead ends: 45 [2019-01-01 17:28:29,041 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:28:29,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:28:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:28:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-01 17:28:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:28:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-01 17:28:29,055 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 18 [2019-01-01 17:28:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:29,055 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-01 17:28:29,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:28:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-01 17:28:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:28:29,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:29,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:28:29,057 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:29,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash 38868062, now seen corresponding path program 1 times [2019-01-01 17:28:29,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:29,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:29,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:29,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:28:29,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:29,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:28:29,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:28:29,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:28:29,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:28:29,124 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 3 states. [2019-01-01 17:28:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:29,167 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-01 17:28:29,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:28:29,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-01 17:28:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:29,170 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:28:29,170 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:28:29,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:28:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:28:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-01 17:28:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:28:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-01 17:28:29,176 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2019-01-01 17:28:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:29,176 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-01 17:28:29,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:28:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-01 17:28:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:28:29,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:29,177 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] [2019-01-01 17:28:29,178 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1504232730, now seen corresponding path program 1 times [2019-01-01 17:28:29,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:29,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:29,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:29,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:29,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:29,523 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-01 17:28:29,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:29,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:28:29,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:28:29,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:28:29,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:28:29,526 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 11 states. [2019-01-01 17:28:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:29,796 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-01 17:28:29,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:28:29,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-01-01 17:28:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:29,798 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:28:29,799 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:28:29,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:28:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:28:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 17:28:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:28:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-01 17:28:29,805 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2019-01-01 17:28:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:29,805 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-01 17:28:29,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:28:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-01 17:28:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:28:29,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:29,807 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-01 17:28:29,807 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash 613425701, now seen corresponding path program 1 times [2019-01-01 17:28:29,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:29,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:30,153 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-01 17:28:30,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:30,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:28:30,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:28:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:28:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:28:30,155 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2019-01-01 17:28:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:30,511 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-01 17:28:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:28:30,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-01 17:28:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:30,514 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:28:30,514 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:28:30,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:28:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:28:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 17:28:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:28:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-01 17:28:30,519 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 26 [2019-01-01 17:28:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:30,519 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-01 17:28:30,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:28:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-01 17:28:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:28:30,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:30,520 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-01 17:28:30,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:30,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1836327624, now seen corresponding path program 1 times [2019-01-01 17:28:30,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:30,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:30,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:30,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:30,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:31,009 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-01 17:28:31,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:31,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:28:31,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:28:31,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:28:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:28:31,011 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2019-01-01 17:28:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:31,435 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-01 17:28:31,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:28:31,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-01 17:28:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:31,438 INFO L225 Difference]: With dead ends: 38 [2019-01-01 17:28:31,438 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 17:28:31,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:28:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 17:28:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-01 17:28:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 17:28:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-01 17:28:31,443 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 27 [2019-01-01 17:28:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:31,444 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-01 17:28:31,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:28:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-01 17:28:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:28:31,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:31,445 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] [2019-01-01 17:28:31,445 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1090999980, now seen corresponding path program 1 times [2019-01-01 17:28:31,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:31,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:31,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:31,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:31,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:32,343 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-01 17:28:32,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:32,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-01 17:28:32,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 17:28:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 17:28:32,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:28:32,345 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 17 states. [2019-01-01 17:28:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:33,333 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2019-01-01 17:28:33,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 17:28:33,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-01-01 17:28:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:33,335 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:28:33,337 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 17:28:33,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-01-01 17:28:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 17:28:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-01 17:28:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 17:28:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2019-01-01 17:28:33,342 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 28 [2019-01-01 17:28:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:33,343 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2019-01-01 17:28:33,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 17:28:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2019-01-01 17:28:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:28:33,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:33,344 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] [2019-01-01 17:28:33,344 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:33,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1091581575, now seen corresponding path program 1 times [2019-01-01 17:28:33,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:33,686 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-01 17:28:33,804 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-01 17:28:33,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:33,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:28:33,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:28:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:28:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:28:33,806 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand 12 states. [2019-01-01 17:28:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:34,053 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2019-01-01 17:28:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:28:34,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-01-01 17:28:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:34,055 INFO L225 Difference]: With dead ends: 37 [2019-01-01 17:28:34,055 INFO L226 Difference]: Without dead ends: 37 [2019-01-01 17:28:34,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-01-01 17:28:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-01 17:28:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-01 17:28:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 17:28:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2019-01-01 17:28:34,059 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 28 [2019-01-01 17:28:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:34,060 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2019-01-01 17:28:34,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:28:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2019-01-01 17:28:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 17:28:34,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:34,062 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] [2019-01-01 17:28:34,062 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash -520709462, now seen corresponding path program 1 times [2019-01-01 17:28:34,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:34,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:34,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:34,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:34,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:34,555 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2019-01-01 17:28:34,802 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-01 17:28:34,881 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-01 17:28:34,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:34,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:28:34,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:28:34,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:28:34,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:28:34,883 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand 12 states. [2019-01-01 17:28:35,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:35,235 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-01-01 17:28:35,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:28:35,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-01-01 17:28:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:35,237 INFO L225 Difference]: With dead ends: 36 [2019-01-01 17:28:35,238 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 17:28:35,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:28:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 17:28:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-01 17:28:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:28:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2019-01-01 17:28:35,242 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 29 [2019-01-01 17:28:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:35,243 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2019-01-01 17:28:35,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:28:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2019-01-01 17:28:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:28:35,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:35,244 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-01 17:28:35,244 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1037875945, now seen corresponding path program 1 times [2019-01-01 17:28:35,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:35,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:35,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:36,027 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-01 17:28:36,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:36,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-01 17:28:36,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 17:28:36,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 17:28:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-01-01 17:28:36,029 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand 21 states. [2019-01-01 17:28:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:37,068 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2019-01-01 17:28:37,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 17:28:37,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-01-01 17:28:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:37,071 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:28:37,071 INFO L226 Difference]: Without dead ends: 35 [2019-01-01 17:28:37,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 17:28:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-01 17:28:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-01 17:28:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 17:28:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2019-01-01 17:28:37,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 30 [2019-01-01 17:28:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:37,086 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2019-01-01 17:28:37,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 17:28:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2019-01-01 17:28:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 17:28:37,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:28:37,087 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-01 17:28:37,088 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-01-01 17:28:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:28:37,088 INFO L82 PathProgramCache]: Analyzing trace with hash 971679827, now seen corresponding path program 1 times [2019-01-01 17:28:37,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:28:37,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:28:37,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:37,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:28:37,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:28:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:28:37,997 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-01-01 17:28:38,162 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-01-01 17:28:39,237 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-01 17:28:39,403 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-01 17:28:39,579 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-01 17:28:39,773 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-01 17:28:39,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:28:39,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-01 17:28:39,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 17:28:39,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 17:28:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2019-01-01 17:28:39,774 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 23 states. [2019-01-01 17:28:41,083 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-01-01 17:28:41,535 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-01-01 17:28:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:28:41,865 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2019-01-01 17:28:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 17:28:41,866 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2019-01-01 17:28:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:28:41,867 INFO L225 Difference]: With dead ends: 34 [2019-01-01 17:28:41,867 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:28:41,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 17:28:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:28:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:28:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:28:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:28:41,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-01-01 17:28:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:28:41,870 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:28:41,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 17:28:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:28:41,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:28:41,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:28:41 BoogieIcfgContainer [2019-01-01 17:28:41,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:28:41,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:28:41,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:28:41,876 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:28:41,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:28:26" (3/4) ... [2019-01-01 17:28:41,880 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:28:41,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:28:41,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2019-01-01 17:28:41,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:28:41,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2019-01-01 17:28:41,893 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-01 17:28:41,893 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-01 17:28:41,893 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:28:41,949 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:28:41,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:28:41,950 INFO L168 Benchmark]: Toolchain (without parser) took 16902.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -296.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-01-01 17:28:41,951 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:28:41,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:28:41,952 INFO L168 Benchmark]: Boogie Preprocessor took 76.99 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-01 17:28:41,953 INFO L168 Benchmark]: RCFGBuilder took 962.48 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: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:28:41,953 INFO L168 Benchmark]: TraceAbstraction took 15084.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -180.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:28:41,954 INFO L168 Benchmark]: Witness Printer took 73.66 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 17:28:41,957 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 696.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.99 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 962.48 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: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15084.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -180.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 73.66 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 631]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 631]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. SAFE Result, 15.0s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 346 SDtfs, 372 SDslu, 1242 SDs, 0 SdLazy, 2181 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 88102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...