./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0158_1_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-ext-properties/test-0158_1_false-valid-free.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 138abb836fefa85c9c71aca16cbe8ef2e2e31ba9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 22:41:46,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:41:46,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:41:46,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:41:46,845 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:41:46,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:41:46,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:41:46,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:41:46,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:41:46,852 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:41:46,853 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:41:46,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:41:46,855 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:41:46,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:41:46,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:41:46,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:41:46,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:41:46,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:41:46,863 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:41:46,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:41:46,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:41:46,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:41:46,870 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:41:46,870 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:41:46,870 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:41:46,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:41:46,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:41:46,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:41:46,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:41:46,876 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:41:46,876 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:41:46,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:41:46,877 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:41:46,877 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:41:46,879 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:41:46,880 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:41:46,880 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:41:46,895 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:41:46,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:41:46,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:41:46,897 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:41:46,897 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:41:46,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:41:46,897 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:41:46,898 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:41:46,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:41:46,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:41:46,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:41:46,899 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:41:46,899 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:41:46,899 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:41:46,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:41:46,899 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:41:46,900 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:41:46,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:41:46,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:41:46,900 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:41:46,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:41:46,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:41:46,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:41:46,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:41:46,902 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:41:46,903 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:41:46,903 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 -> 138abb836fefa85c9c71aca16cbe8ef2e2e31ba9 [2019-01-13 22:41:46,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:41:46,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:41:46,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:41:46,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:41:46,955 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:41:46,956 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0158_1_false-valid-free.i [2019-01-13 22:41:47,010 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df93ab9b3/741dbbb21e404b0baf96173b16832f19/FLAG5146206c8 [2019-01-13 22:41:47,455 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:41:47,456 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0158_1_false-valid-free.i [2019-01-13 22:41:47,468 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df93ab9b3/741dbbb21e404b0baf96173b16832f19/FLAG5146206c8 [2019-01-13 22:41:47,797 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df93ab9b3/741dbbb21e404b0baf96173b16832f19 [2019-01-13 22:41:47,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:41:47,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:41:47,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:41:47,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:41:47,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:41:47,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:41:47" (1/1) ... [2019-01-13 22:41:47,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d419f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:47, skipping insertion in model container [2019-01-13 22:41:47,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:41:47" (1/1) ... [2019-01-13 22:41:47,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:41:47,874 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:41:48,249 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:41:48,258 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:41:48,319 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:41:48,386 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:41:48,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48 WrapperNode [2019-01-13 22:41:48,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:41:48,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:41:48,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:41:48,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:41:48,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (1/1) ... [2019-01-13 22:41:48,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (1/1) ... [2019-01-13 22:41:48,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (1/1) ... [2019-01-13 22:41:48,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (1/1) ... [2019-01-13 22:41:48,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (1/1) ... [2019-01-13 22:41:48,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (1/1) ... [2019-01-13 22:41:48,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (1/1) ... [2019-01-13 22:41:48,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:41:48,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:41:48,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:41:48,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:41:48,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:41:48,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:41:48,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:41:48,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:41:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:41:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:41:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:41:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:41:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:41:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:41:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:41:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:41:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:41:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:41:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:41:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:41:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:41:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:41:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:41:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:41:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:41:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:41:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:41:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:41:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:41:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:41:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:41:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:41:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:41:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:41:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:41:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:41:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:41:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:41:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:41:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:41:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:41:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:41:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:41:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:41:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:41:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:41:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:41:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:41:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:41:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:41:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:41:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:41:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:41:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:41:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:41:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:41:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:41:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:41:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:41:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:41:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:41:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:41:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:41:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:41:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:41:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:41:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:41:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:41:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:41:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:41:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:41:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:41:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:41:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:41:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:41:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:41:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:41:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:41:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:41:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:41:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:41:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:41:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:41:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:41:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:41:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:41:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:41:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:41:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:41:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:41:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:41:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:41:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:41:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:41:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:41:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:41:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:41:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:41:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:41:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:41:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:41:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:41:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:41:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:41:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:41:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:41:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:41:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:41:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:41:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:41:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:41:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:41:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:41:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:41:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:41:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:41:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:41:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:41:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:41:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:41:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:41:49,276 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:41:49,277 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-13 22:41:49,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:41:49 BoogieIcfgContainer [2019-01-13 22:41:49,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:41:49,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:41:49,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:41:49,282 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:41:49,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:41:47" (1/3) ... [2019-01-13 22:41:49,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5e963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:41:49, skipping insertion in model container [2019-01-13 22:41:49,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:41:48" (2/3) ... [2019-01-13 22:41:49,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5e963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:41:49, skipping insertion in model container [2019-01-13 22:41:49,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:41:49" (3/3) ... [2019-01-13 22:41:49,287 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0158_1_false-valid-free.i [2019-01-13 22:41:49,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:41:49,304 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-01-13 22:41:49,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-01-13 22:41:49,347 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:41:49,348 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:41:49,348 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:41:49,348 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:41:49,349 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:41:49,349 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:41:49,349 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:41:49,349 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:41:49,349 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:41:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-13 22:41:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-13 22:41:49,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:49,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:49,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:41:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1868982535, now seen corresponding path program 1 times [2019-01-13 22:41:49,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:49,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:49,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:41:49,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:49,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:41:49,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:41:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:41:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:41:49,605 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-01-13 22:41:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:49,796 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-01-13 22:41:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:41:49,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-13 22:41:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:49,808 INFO L225 Difference]: With dead ends: 40 [2019-01-13 22:41:49,808 INFO L226 Difference]: Without dead ends: 37 [2019-01-13 22:41:49,811 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-13 22:41:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-13 22:41:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-13 22:41:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-13 22:41:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-13 22:41:49,848 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 7 [2019-01-13 22:41:49,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:49,849 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-13 22:41:49,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:41:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-13 22:41:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-13 22:41:49,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:49,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:49,850 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:41:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:49,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1868982534, now seen corresponding path program 1 times [2019-01-13 22:41:49,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:49,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:49,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:49,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-13 22:41:49,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:49,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:41:49,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:41:49,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:41:49,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:41:49,904 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 3 states. [2019-01-13 22:41:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:49,969 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-13 22:41:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:41:49,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-13 22:41:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:49,971 INFO L225 Difference]: With dead ends: 30 [2019-01-13 22:41:49,971 INFO L226 Difference]: Without dead ends: 30 [2019-01-13 22:41:49,972 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-13 22:41:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-13 22:41:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-13 22:41:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-13 22:41:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-01-13 22:41:49,976 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 7 [2019-01-13 22:41:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:49,977 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-01-13 22:41:49,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:41:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-01-13 22:41:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:41:49,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:49,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:49,978 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:41:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:49,979 INFO L82 PathProgramCache]: Analyzing trace with hash 207144873, now seen corresponding path program 1 times [2019-01-13 22:41:49,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:49,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:49,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:49,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:41:50,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:50,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:41:50,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:41:50,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:41:50,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:41:50,192 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2019-01-13 22:41:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:50,316 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-01-13 22:41:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:41:50,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-13 22:41:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:50,318 INFO L225 Difference]: With dead ends: 29 [2019-01-13 22:41:50,318 INFO L226 Difference]: Without dead ends: 29 [2019-01-13 22:41:50,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:41:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-13 22:41:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-13 22:41:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-13 22:41:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-13 22:41:50,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 15 [2019-01-13 22:41:50,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:50,326 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-13 22:41:50,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:41:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-13 22:41:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:41:50,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:50,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:50,327 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:41:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2126523837, now seen corresponding path program 1 times [2019-01-13 22:41:50,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:50,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:50,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:41:50,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:50,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:41:50,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:41:50,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:41:50,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:41:50,453 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2019-01-13 22:41:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:50,852 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-13 22:41:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:41:50,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 22:41:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:50,853 INFO L225 Difference]: With dead ends: 28 [2019-01-13 22:41:50,853 INFO L226 Difference]: Without dead ends: 28 [2019-01-13 22:41:50,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:41:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-13 22:41:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-13 22:41:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-13 22:41:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-13 22:41:50,858 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 16 [2019-01-13 22:41:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:50,859 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-13 22:41:50,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:41:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-13 22:41:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 22:41:50,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:50,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:50,861 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:41:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1497729579, now seen corresponding path program 1 times [2019-01-13 22:41:50,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:50,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:50,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:41:50,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:50,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:41:50,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:41:50,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:41:50,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:41:50,974 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 5 states. [2019-01-13 22:41:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:51,132 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-13 22:41:51,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:41:51,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-13 22:41:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:51,134 INFO L225 Difference]: With dead ends: 27 [2019-01-13 22:41:51,134 INFO L226 Difference]: Without dead ends: 27 [2019-01-13 22:41:51,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:41:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-13 22:41:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-13 22:41:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-13 22:41:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-13 22:41:51,139 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2019-01-13 22:41:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:51,139 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-13 22:41:51,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:41:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-13 22:41:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 22:41:51,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:51,141 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-13 22:41:51,141 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:41:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -815023233, now seen corresponding path program 1 times [2019-01-13 22:41:51,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:51,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:41:51,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:51,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:41:51,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:41:51,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:41:51,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:41:51,272 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 6 states. [2019-01-13 22:41:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:51,396 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-13 22:41:51,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:41:51,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-13 22:41:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:51,398 INFO L225 Difference]: With dead ends: 26 [2019-01-13 22:41:51,398 INFO L226 Difference]: Without dead ends: 26 [2019-01-13 22:41:51,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:41:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-13 22:41:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-13 22:41:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-13 22:41:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-13 22:41:51,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2019-01-13 22:41:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:51,403 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-13 22:41:51,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:41:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-13 22:41:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 22:41:51,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:51,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:41:51,404 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:41:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash 504083629, now seen corresponding path program 1 times [2019-01-13 22:41:51,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:51,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:51,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:41:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:41:51,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:41:51,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:41:51,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:41:51,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:41:51,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:41:51,535 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2019-01-13 22:41:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:41:51,673 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-01-13 22:41:51,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:41:51,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-13 22:41:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:41:51,675 INFO L225 Difference]: With dead ends: 25 [2019-01-13 22:41:51,675 INFO L226 Difference]: Without dead ends: 25 [2019-01-13 22:41:51,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:41:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-13 22:41:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-13 22:41:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-13 22:41:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-13 22:41:51,679 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2019-01-13 22:41:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:41:51,679 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-13 22:41:51,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:41:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-13 22:41:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 22:41:51,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:41:51,680 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] [2019-01-13 22:41:51,681 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:41:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:41:51,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1553276607, now seen corresponding path program 1 times [2019-01-13 22:41:51,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:41:51,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:41:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:51,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:41:51,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:41:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:41:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:41:51,745 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:41:51,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:41:51 BoogieIcfgContainer [2019-01-13 22:41:51,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:41:51,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:41:51,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:41:51,775 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:41:51,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:41:49" (3/4) ... [2019-01-13 22:41:51,778 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 22:41:51,828 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 22:41:51,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:41:51,829 INFO L168 Benchmark]: Toolchain (without parser) took 4027.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.4 MB in the beginning and 974.1 MB in the end (delta: -22.7 MB). Peak memory consumption was 127.2 MB. Max. memory is 11.5 GB. [2019-01-13 22:41:51,831 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:41:51,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.38 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-13 22:41:51,833 INFO L168 Benchmark]: Boogie Preprocessor took 154.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -212.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-13 22:41:51,834 INFO L168 Benchmark]: RCFGBuilder took 736.15 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: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:41:51,835 INFO L168 Benchmark]: TraceAbstraction took 2495.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.1 MB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. [2019-01-13 22:41:51,835 INFO L168 Benchmark]: Witness Printer took 53.48 ms. Allocated memory is still 1.2 GB. Free memory is still 974.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:41:51,841 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 583.38 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 154.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -212.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 736.15 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: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2495.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.1 MB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. * Witness Printer took 53.48 ms. Allocated memory is still 1.2 GB. Free memory is still 974.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 641]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L622-L629] union { void *p0; struct { char c[2]; int p1; int p2; } str; } data; [L630] data.p0 = malloc(37U) VAL [data={-4:0}, malloc(37U)={-2:0}] [L631] EXPR data.p0 VAL [data={-4:0}, data.p0={-2:0}, malloc(37U)={-2:0}] [L631] void *ptr = data.p0; [L632] COND FALSE !(__VERIFIER_nondet_int()) [L635] data.str.p2 = 30 VAL [data={-4:0}, malloc(37U)={-2:0}, ptr={-2:0}] [L637] EXPR data.str.p2 VAL [data={-4:0}, data.str.p2=30, malloc(37U)={-2:0}, ptr={-2:0}] [L637] COND FALSE !(25 > data.str.p2) [L640] EXPR data.p0 VAL [data={-4:0}, data.p0={-2:0}, malloc(37U)={-2:0}, ptr={-2:0}] [L640] free(data.p0) VAL [data={-4:0}, data.p0={-2:0}, malloc(37U)={-2:0}, ptr={-2:0}] [L640] free(data.p0) VAL [data={-4:0}, data.p0={-2:0}, malloc(37U)={-2:0}, ptr={-2:0}] [L640] free(data.p0) [L641] free(ptr) VAL [data={-4:0}, malloc(37U)={-2:0}, ptr={-2:0}] [L641] free(ptr) VAL [data={-4:0}, malloc(37U)={-2:0}, ptr={-2:0}] [L641] free(ptr) VAL [data={-4:0}, malloc(37U)={-2:0}, ptr={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 21 error locations. UNSAFE Result, 2.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 201 SDslu, 161 SDs, 0 SdLazy, 160 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 5734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...