./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-ext-properties/test-0019_1_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 6808c66573fa9f309265139cf6a41427fc3491cf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:49:23,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:49:23,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:49:23,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:49:23,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:49:23,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:49:23,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:49:23,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:49:23,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:49:23,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:49:23,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:49:23,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:49:23,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:49:23,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:49:23,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:49:23,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:49:23,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:49:23,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:49:23,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:49:23,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:49:23,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:49:23,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:49:23,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:49:23,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:49:23,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:49:23,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:49:23,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:49:23,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:49:23,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:49:23,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:49:23,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:49:23,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:49:23,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:49:23,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:49:23,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:49:23,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:49:23,101 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:49:23,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:49:23,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:49:23,129 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:49:23,131 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:49:23,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:49:23,133 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:49:23,133 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:49:23,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:49:23,134 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:49:23,134 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:49:23,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:49:23,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:49:23,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:49:23,134 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:49:23,135 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:49:23,135 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:49:23,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:49:23,135 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:49:23,135 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:49:23,136 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:49:23,137 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:49:23,137 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:49:23,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:49:23,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:49:23,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:49:23,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:49:23,138 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:49:23,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:49:23,138 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 -> 6808c66573fa9f309265139cf6a41427fc3491cf [2018-11-28 22:49:23,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:49:23,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:49:23,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:49:23,194 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:49:23,195 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:49:23,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-11-28 22:49:23,254 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc8525d7/ae5b61e48ece4a74a3b9633d76f8540a/FLAGf29fdc559 [2018-11-28 22:49:23,780 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:49:23,781 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-11-28 22:49:23,799 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc8525d7/ae5b61e48ece4a74a3b9633d76f8540a/FLAGf29fdc559 [2018-11-28 22:49:24,063 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc8525d7/ae5b61e48ece4a74a3b9633d76f8540a [2018-11-28 22:49:24,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:49:24,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:49:24,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:49:24,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:49:24,073 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:49:24,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23772110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24, skipping insertion in model container [2018-11-28 22:49:24,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:49:24,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:49:24,490 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:49:24,511 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:49:24,588 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:49:24,738 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:49:24,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24 WrapperNode [2018-11-28 22:49:24,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:49:24,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:49:24,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:49:24,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:49:24,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (1/1) ... [2018-11-28 22:49:24,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:49:24,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:49:24,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:49:24,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:49:24,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (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 [2018-11-28 22:49:24,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:49:24,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:49:24,868 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-11-28 22:49:24,868 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-11-28 22:49:24,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:49:24,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 22:49:24,868 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:49:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:49:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:49:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:49:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:49:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:49:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:49:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:49:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:49:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:49:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:49:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:49:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:49:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:49:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:49:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:49:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:49:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:49:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:49:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:49:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:49:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:49:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:49:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:49:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:49:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:49:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:49:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:49:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:49:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:49:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:49:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:49:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:49:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:49:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:49:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:49:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:49:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:49:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:49:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:49:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:49:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:49:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:49:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:49:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:49:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:49:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:49:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:49:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:49:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:49:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:49:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:49:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:49:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:49:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:49:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:49:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:49:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:49:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:49:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:49:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:49:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:49:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:49:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:49:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 22:49:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:49:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:49:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:49:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:49:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:49:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:49:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:49:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:49:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:49:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:49:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:49:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:49:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:49:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:49:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:49:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:49:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:49:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:49:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:49:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:49:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:49:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:49:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:49:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:49:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:49:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:49:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:49:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:49:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:49:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:49:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:49:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:49:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:49:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:49:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:49:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:49:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-11-28 22:49:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:49:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 22:49:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 22:49:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:49:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-11-28 22:49:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:49:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:49:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:49:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:49:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:49:25,788 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:49:25,788 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 22:49:25,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:49:25 BoogieIcfgContainer [2018-11-28 22:49:25,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:49:25,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:49:25,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:49:25,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:49:25,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:49:24" (1/3) ... [2018-11-28 22:49:25,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb57b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:49:25, skipping insertion in model container [2018-11-28 22:49:25,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:24" (2/3) ... [2018-11-28 22:49:25,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb57b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:49:25, skipping insertion in model container [2018-11-28 22:49:25,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:49:25" (3/3) ... [2018-11-28 22:49:25,801 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_true-valid-memsafety_true-termination.i [2018-11-28 22:49:25,815 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:49:25,825 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-11-28 22:49:25,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2018-11-28 22:49:25,876 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:49:25,877 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:49:25,878 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:49:25,878 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:49:25,879 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:49:25,879 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:49:25,879 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:49:25,879 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:49:25,879 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:49:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-28 22:49:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:49:25,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:25,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:25,915 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:25,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash -515788711, now seen corresponding path program 1 times [2018-11-28 22:49:25,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:25,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:25,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:26,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:26,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:26,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:26,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:26,299 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-28 22:49:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:27,341 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-28 22:49:27,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:27,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:49:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:27,359 INFO L225 Difference]: With dead ends: 70 [2018-11-28 22:49:27,360 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 22:49:27,362 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 [2018-11-28 22:49:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 22:49:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-28 22:49:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 22:49:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-11-28 22:49:27,413 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2018-11-28 22:49:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:27,415 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-11-28 22:49:27,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-28 22:49:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:49:27,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:27,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:27,418 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:27,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:27,418 INFO L82 PathProgramCache]: Analyzing trace with hash -515788710, now seen corresponding path program 1 times [2018-11-28 22:49:27,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:27,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:27,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:27,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:27,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:27,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:27,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:27,634 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2018-11-28 22:49:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:28,092 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-28 22:49:28,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:28,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:49:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:28,095 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:49:28,095 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:49:28,096 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 [2018-11-28 22:49:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:49:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-28 22:49:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 22:49:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-11-28 22:49:28,105 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 9 [2018-11-28 22:49:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:28,106 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-11-28 22:49:28,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-28 22:49:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:49:28,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:28,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:28,107 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:28,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:28,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1751712613, now seen corresponding path program 1 times [2018-11-28 22:49:28,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:28,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:28,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:28,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:28,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:49:28,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:49:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:49:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:49:28,260 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 7 states. [2018-11-28 22:49:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:28,515 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-28 22:49:28,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:28,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-28 22:49:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:28,518 INFO L225 Difference]: With dead ends: 61 [2018-11-28 22:49:28,521 INFO L226 Difference]: Without dead ends: 61 [2018-11-28 22:49:28,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-28 22:49:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-28 22:49:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 22:49:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-11-28 22:49:28,528 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 11 [2018-11-28 22:49:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:28,528 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-11-28 22:49:28,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:49:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-28 22:49:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:49:28,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:28,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:28,530 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:28,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:28,530 INFO L82 PathProgramCache]: Analyzing trace with hash 231357725, now seen corresponding path program 1 times [2018-11-28 22:49:28,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:28,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:28,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:28,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:28,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:28,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:28,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:28,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:28,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:28,705 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2018-11-28 22:49:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:28,876 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-28 22:49:28,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:49:28,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 22:49:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:28,879 INFO L225 Difference]: With dead ends: 60 [2018-11-28 22:49:28,879 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 22:49:28,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 22:49:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 22:49:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 22:49:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-28 22:49:28,886 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 13 [2018-11-28 22:49:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:28,886 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-28 22:49:28,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-28 22:49:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:49:28,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:28,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:28,887 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:28,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash 231357726, now seen corresponding path program 1 times [2018-11-28 22:49:28,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:28,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:28,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:28,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:28,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:29,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:29,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:29,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:29,073 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-11-28 22:49:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:29,283 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-28 22:49:29,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:49:29,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 22:49:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:29,293 INFO L225 Difference]: With dead ends: 59 [2018-11-28 22:49:29,293 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 22:49:29,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 22:49:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-28 22:49:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 22:49:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-28 22:49:29,301 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 13 [2018-11-28 22:49:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:29,301 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-28 22:49:29,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-28 22:49:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:49:29,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:29,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:29,303 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:29,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1044526556, now seen corresponding path program 1 times [2018-11-28 22:49:29,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:29,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:29,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:29,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:29,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:29,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:29,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:49:29,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:49:29,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:49:29,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:49:29,510 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 11 states. [2018-11-28 22:49:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:29,943 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-28 22:49:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:49:29,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-28 22:49:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:29,945 INFO L225 Difference]: With dead ends: 58 [2018-11-28 22:49:29,946 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 22:49:29,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-11-28 22:49:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 22:49:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-28 22:49:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 22:49:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-28 22:49:29,953 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 16 [2018-11-28 22:49:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:29,954 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-28 22:49:29,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:49:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-28 22:49:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:49:29,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:29,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:29,956 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:29,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1044526555, now seen corresponding path program 1 times [2018-11-28 22:49:29,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:29,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:29,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:30,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:30,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:49:30,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:49:30,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:49:30,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:49:30,317 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 11 states. [2018-11-28 22:49:30,956 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 22:49:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:31,275 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-28 22:49:31,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:49:31,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-28 22:49:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:31,279 INFO L225 Difference]: With dead ends: 57 [2018-11-28 22:49:31,279 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 22:49:31,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-11-28 22:49:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 22:49:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-28 22:49:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 22:49:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-28 22:49:31,287 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 16 [2018-11-28 22:49:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:31,287 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-28 22:49:31,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:49:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-28 22:49:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:49:31,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:31,289 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] [2018-11-28 22:49:31,290 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:31,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 504402916, now seen corresponding path program 1 times [2018-11-28 22:49:31,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:31,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:31,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:31,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:31,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:31,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:49:31,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:31,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:31,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:31,374 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 3 states. [2018-11-28 22:49:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:31,458 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-28 22:49:31,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:31,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 22:49:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:31,460 INFO L225 Difference]: With dead ends: 53 [2018-11-28 22:49:31,461 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 22:49:31,461 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 [2018-11-28 22:49:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 22:49:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-28 22:49:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 22:49:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-28 22:49:31,468 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 24 [2018-11-28 22:49:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:31,468 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-28 22:49:31,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-28 22:49:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:49:31,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:31,469 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] [2018-11-28 22:49:31,470 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:31,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 504402917, now seen corresponding path program 1 times [2018-11-28 22:49:31,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:31,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:31,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:31,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:31,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:49:31,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:31,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:31,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:31,576 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 3 states. [2018-11-28 22:49:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:31,643 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-28 22:49:31,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:31,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 22:49:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:31,646 INFO L225 Difference]: With dead ends: 49 [2018-11-28 22:49:31,646 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 22:49:31,646 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 [2018-11-28 22:49:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 22:49:31,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-28 22:49:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 22:49:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-28 22:49:31,651 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 24 [2018-11-28 22:49:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:31,651 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-28 22:49:31,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-28 22:49:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:49:31,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:31,652 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] [2018-11-28 22:49:31,652 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:31,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1229606583, now seen corresponding path program 1 times [2018-11-28 22:49:31,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:31,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:31,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:31,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:31,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:32,037 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 22:49:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:32,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:32,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 22:49:32,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:49:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:49:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:49:32,652 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 20 states. [2018-11-28 22:49:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:34,047 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-28 22:49:34,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 22:49:34,047 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-11-28 22:49:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:34,048 INFO L225 Difference]: With dead ends: 47 [2018-11-28 22:49:34,048 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 22:49:34,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2018-11-28 22:49:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 22:49:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-28 22:49:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 22:49:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-28 22:49:34,052 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 30 [2018-11-28 22:49:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:34,053 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-28 22:49:34,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:49:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-28 22:49:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:49:34,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:34,054 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] [2018-11-28 22:49:34,054 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:34,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1229606582, now seen corresponding path program 1 times [2018-11-28 22:49:34,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:34,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:34,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:34,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:34,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 22:49:34,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 22:49:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 22:49:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:49:34,798 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 19 states. [2018-11-28 22:49:35,278 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-11-28 22:49:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:36,182 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-28 22:49:36,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 22:49:36,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-11-28 22:49:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:36,184 INFO L225 Difference]: With dead ends: 45 [2018-11-28 22:49:36,185 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 22:49:36,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 22:49:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 22:49:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 22:49:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:49:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-28 22:49:36,189 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2018-11-28 22:49:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:36,189 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-28 22:49:36,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 22:49:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-28 22:49:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 22:49:36,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:36,190 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] [2018-11-28 22:49:36,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:36,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash 536901616, now seen corresponding path program 1 times [2018-11-28 22:49:36,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:36,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:36,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:36,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:36,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:37,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:37,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 22:49:37,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:49:37,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:49:37,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:49:37,127 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-11-28 22:49:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:38,602 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-28 22:49:38,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 22:49:38,603 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-11-28 22:49:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:38,604 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:49:38,604 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:49:38,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 22:49:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:49:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 22:49:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:49:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-28 22:49:38,609 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2018-11-28 22:49:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:38,609 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-28 22:49:38,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:49:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-28 22:49:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 22:49:38,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:38,610 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] [2018-11-28 22:49:38,610 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:38,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash 536901617, now seen corresponding path program 1 times [2018-11-28 22:49:38,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:38,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:38,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:38,819 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-28 22:49:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:39,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:39,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 22:49:39,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 22:49:39,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 22:49:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:49:39,520 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-11-28 22:49:40,139 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-11-28 22:49:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:41,347 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-28 22:49:41,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 22:49:41,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-11-28 22:49:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:41,350 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:49:41,350 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:49:41,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 22:49:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:49:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 22:49:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:49:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-28 22:49:41,356 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-11-28 22:49:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:41,356 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-28 22:49:41,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 22:49:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-28 22:49:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 22:49:41,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:41,359 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, 1, 1] [2018-11-28 22:49:41,361 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:41,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:41,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1946772458, now seen corresponding path program 1 times [2018-11-28 22:49:41,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:41,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:41,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:41,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:41,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:41,633 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-28 22:49:42,137 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-11-28 22:49:42,498 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-28 22:49:43,768 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2018-11-28 22:49:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:44,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:44,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-11-28 22:49:44,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 22:49:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 22:49:44,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-11-28 22:49:44,197 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 26 states. [2018-11-28 22:49:44,734 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-11-28 22:49:44,936 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-11-28 22:49:45,113 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-11-28 22:49:45,381 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2018-11-28 22:49:45,596 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-11-28 22:49:46,121 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-28 22:49:47,290 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2018-11-28 22:49:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:47,520 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2018-11-28 22:49:47,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 22:49:47,521 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-11-28 22:49:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:47,522 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:49:47,522 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:49:47,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 22:49:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:49:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 22:49:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:49:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-11-28 22:49:47,526 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 36 [2018-11-28 22:49:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:47,526 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-11-28 22:49:47,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 22:49:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-11-28 22:49:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 22:49:47,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:47,527 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, 1, 1] [2018-11-28 22:49:47,528 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:47,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:47,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1946067215, now seen corresponding path program 1 times [2018-11-28 22:49:47,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:47,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:47,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:47,748 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-28 22:49:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:48,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:48,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-11-28 22:49:48,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 22:49:48,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 22:49:48,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:49:48,701 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 24 states. [2018-11-28 22:49:49,289 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-11-28 22:49:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:50,115 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2018-11-28 22:49:50,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 22:49:50,116 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2018-11-28 22:49:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:50,117 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:49:50,117 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:49:50,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 22:49:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:49:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:49:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:49:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 40 transitions. [2018-11-28 22:49:50,120 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 40 transitions. Word has length 36 [2018-11-28 22:49:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:50,121 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 40 transitions. [2018-11-28 22:49:50,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 22:49:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2018-11-28 22:49:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 22:49:50,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:50,122 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, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:50,122 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION]=== [2018-11-28 22:49:50,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash -577402277, now seen corresponding path program 1 times [2018-11-28 22:49:50,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:50,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:50,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:50,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:50,625 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-11-28 22:49:50,919 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2018-11-28 22:49:51,124 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-11-28 22:49:51,289 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2018-11-28 22:49:51,501 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2018-11-28 22:49:52,982 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2018-11-28 22:49:53,144 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2018-11-28 22:49:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:53,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:53,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-11-28 22:49:53,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 22:49:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 22:49:53,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-11-28 22:49:53,340 INFO L87 Difference]: Start difference. First operand 41 states and 40 transitions. Second operand 26 states. [2018-11-28 22:49:53,725 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-28 22:49:53,949 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-11-28 22:49:54,129 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-11-28 22:49:54,460 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2018-11-28 22:49:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:55,585 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2018-11-28 22:49:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 22:49:55,586 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2018-11-28 22:49:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:55,587 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:49:55,587 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:49:55,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 22:49:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:49:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:49:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:49:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:49:55,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-28 22:49:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:55,589 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:49:55,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 22:49:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:49:55,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:49:55,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:49:55 BoogieIcfgContainer [2018-11-28 22:49:55,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:49:55,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:49:55,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:49:55,596 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:49:55,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:49:25" (3/4) ... [2018-11-28 22:49:55,601 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:49:55,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:49:55,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2018-11-28 22:49:55,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:49:55,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2018-11-28 22:49:55,615 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 22:49:55,615 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 22:49:55,615 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:49:55,692 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:49:55,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:49:55,694 INFO L168 Benchmark]: Toolchain (without parser) took 31626.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 260.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:55,695 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. [2018-11-28 22:49:55,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:55,696 INFO L168 Benchmark]: Boogie Preprocessor took 65.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:55,696 INFO L168 Benchmark]: RCFGBuilder took 983.73 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:55,698 INFO L168 Benchmark]: TraceAbstraction took 29805.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 283.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.4 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:55,699 INFO L168 Benchmark]: Witness Printer took 96.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:55,703 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 670.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 983.73 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29805.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 283.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.4 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. * Witness Printer took 96.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 639]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: 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: 625]: 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: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: 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: 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: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: 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: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: 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: 634]: 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 - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 33 error locations. SAFE Result, 29.7s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 532 SDtfs, 512 SDslu, 2228 SDs, 0 SdLazy, 4752 SolverSat, 248 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 353 ConstructedInterpolants, 0 QuantifiedInterpolants, 205898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...