./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.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 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:56:12,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:56:12,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:56:12,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:56:12,076 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:56:12,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:56:12,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:56:12,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:56:12,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:56:12,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:56:12,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:56:12,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:56:12,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:56:12,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:56:12,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:56:12,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:56:12,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:56:12,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:56:12,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:56:12,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:56:12,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:56:12,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:56:12,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:56:12,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:56:12,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:56:12,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:56:12,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:56:12,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:56:12,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:56:12,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:56:12,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:56:12,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:56:12,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:56:12,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:56:12,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:56:12,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:56:12,115 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:56:12,130 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:56:12,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:56:12,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:56:12,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:56:12,132 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:56:12,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:56:12,133 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:56:12,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:56:12,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:56:12,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:56:12,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:56:12,134 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:56:12,134 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:56:12,134 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:56:12,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:56:12,135 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:56:12,135 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:56:12,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:56:12,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:56:12,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:56:12,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:56:12,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:56:12,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:56:12,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:56:12,138 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:56:12,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:56:12,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 -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-01-01 17:56:12,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:56:12,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:56:12,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:56:12,202 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:56:12,202 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:56:12,204 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i [2019-01-01 17:56:12,264 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62511a199/789626eeb47c4d088829be282eafc821/FLAG1c6be8954 [2019-01-01 17:56:12,798 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:56:12,799 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i [2019-01-01 17:56:12,813 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62511a199/789626eeb47c4d088829be282eafc821/FLAG1c6be8954 [2019-01-01 17:56:13,059 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62511a199/789626eeb47c4d088829be282eafc821 [2019-01-01 17:56:13,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:56:13,066 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:56:13,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:56:13,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:56:13,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:56:13,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fed245b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13, skipping insertion in model container [2019-01-01 17:56:13,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:56:13,152 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:56:13,547 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:56:13,559 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:56:13,679 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:56:13,742 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:56:13,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13 WrapperNode [2019-01-01 17:56:13,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:56:13,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:56:13,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:56:13,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:56:13,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (1/1) ... [2019-01-01 17:56:13,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:56:13,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:56:13,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:56:13,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:56:13,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:56:13,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:56:13,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:56:13,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:56:13,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:56:13,905 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-01-01 17:56:13,906 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-01-01 17:56:13,906 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-01 17:56:13,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:56:13,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:56:13,906 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:56:13,906 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:56:13,906 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:56:13,907 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:56:13,907 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:56:13,907 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:56:13,907 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:56:13,907 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:56:13,907 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:56:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:56:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:56:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:56:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:56:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:56:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:56:13,909 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:56:13,909 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:56:13,909 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:56:13,909 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:56:13,909 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:56:13,909 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:56:13,909 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:56:13,910 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:56:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:56:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:56:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:56:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:56:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:56:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:56:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:56:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:56:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:56:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:56:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:56:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:56:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:56:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:56:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:56:13,913 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:56:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:56:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:56:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:56:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:56:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:56:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:56:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:56:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:56:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:56:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:56:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:56:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:56:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:56:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:56:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:56:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:56:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:56:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:56:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:56:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:56:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:56:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 17:56:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:56:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:56:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 17:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 17:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:56:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:56:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:56:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:56:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:56:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:56:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:56:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:56:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:56:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:56:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:56:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:56:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:56:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:56:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:56:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:56:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:56:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:56:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:56:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:56:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:56:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:56:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:56:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:56:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:56:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:56:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:56:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:56:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:56:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-01-01 17:56:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:56:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:56:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:56:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:56:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-01-01 17:56:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:56:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-01 17:56:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:56:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:56:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 17:56:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:56:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:56:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:56:15,016 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:56:15,016 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-01 17:56:15,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:56:15 BoogieIcfgContainer [2019-01-01 17:56:15,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:56:15,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:56:15,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:56:15,020 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:56:15,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:56:13" (1/3) ... [2019-01-01 17:56:15,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517856fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:56:15, skipping insertion in model container [2019-01-01 17:56:15,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:56:13" (2/3) ... [2019-01-01 17:56:15,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517856fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:56:15, skipping insertion in model container [2019-01-01 17:56:15,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:56:15" (3/3) ... [2019-01-01 17:56:15,024 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i [2019-01-01 17:56:15,033 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:56:15,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-01-01 17:56:15,060 INFO L257 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-01-01 17:56:15,088 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:56:15,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:56:15,089 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:56:15,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:56:15,089 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:56:15,089 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:56:15,090 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:56:15,090 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:56:15,090 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:56:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-01-01 17:56:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 17:56:15,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:15,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:15,124 INFO L423 AbstractCegarLoop]: === Iteration 1 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash -16887216, now seen corresponding path program 1 times [2019-01-01 17:56:15,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:15,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:15,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:15,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:56:15,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-01 17:56:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 17:56:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 17:56:15,295 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2019-01-01 17:56:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:15,318 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-01-01 17:56:15,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 17:56:15,320 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-01 17:56:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:15,331 INFO L225 Difference]: With dead ends: 114 [2019-01-01 17:56:15,332 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 17:56:15,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 17:56:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 17:56:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-01 17:56:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 17:56:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2019-01-01 17:56:15,387 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 8 [2019-01-01 17:56:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:15,388 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2019-01-01 17:56:15,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-01 17:56:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2019-01-01 17:56:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:56:15,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:15,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:15,391 INFO L423 AbstractCegarLoop]: === Iteration 2 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:15,391 INFO L82 PathProgramCache]: Analyzing trace with hash -523436808, now seen corresponding path program 1 times [2019-01-01 17:56:15,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:15,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:15,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:15,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:15,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:15,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:56:15,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:56:15,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:56:15,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:56:15,645 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 5 states. [2019-01-01 17:56:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:16,449 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-01-01 17:56:16,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:56:16,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:56:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:16,457 INFO L225 Difference]: With dead ends: 120 [2019-01-01 17:56:16,457 INFO L226 Difference]: Without dead ends: 120 [2019-01-01 17:56:16,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-01 17:56:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2019-01-01 17:56:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 17:56:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-01-01 17:56:16,476 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 9 [2019-01-01 17:56:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:16,476 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-01-01 17:56:16,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:56:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-01-01 17:56:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:56:16,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:16,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:16,478 INFO L423 AbstractCegarLoop]: === Iteration 3 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash -523436807, now seen corresponding path program 1 times [2019-01-01 17:56:16,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:16,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:16,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:16,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:16,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:56:16,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:56:16,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:56:16,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:56:16,650 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-01-01 17:56:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:16,994 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-01-01 17:56:16,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:56:16,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:56:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:16,998 INFO L225 Difference]: With dead ends: 119 [2019-01-01 17:56:16,998 INFO L226 Difference]: Without dead ends: 119 [2019-01-01 17:56:17,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-01 17:56:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2019-01-01 17:56:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 17:56:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-01-01 17:56:17,012 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 9 [2019-01-01 17:56:17,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:17,012 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-01-01 17:56:17,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:56:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-01-01 17:56:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:56:17,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:17,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:17,014 INFO L423 AbstractCegarLoop]: === Iteration 4 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash 953328253, now seen corresponding path program 1 times [2019-01-01 17:56:17,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:17,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:17,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:17,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:17,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:56:17,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:56:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:56:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:56:17,060 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 3 states. [2019-01-01 17:56:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:17,236 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-01-01 17:56:17,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:56:17,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:56:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:17,239 INFO L225 Difference]: With dead ends: 113 [2019-01-01 17:56:17,239 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 17:56:17,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:56:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 17:56:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-01 17:56:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 17:56:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2019-01-01 17:56:17,258 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 10 [2019-01-01 17:56:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:17,258 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2019-01-01 17:56:17,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:56:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2019-01-01 17:56:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:56:17,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:17,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:17,260 INFO L423 AbstractCegarLoop]: === Iteration 5 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:17,260 INFO L82 PathProgramCache]: Analyzing trace with hash 953328254, now seen corresponding path program 1 times [2019-01-01 17:56:17,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:17,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:17,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:17,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:17,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:56:17,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:56:17,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:56:17,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:56:17,348 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 3 states. [2019-01-01 17:56:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:17,445 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-01 17:56:17,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:56:17,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:56:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:17,448 INFO L225 Difference]: With dead ends: 112 [2019-01-01 17:56:17,448 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 17:56:17,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:56:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 17:56:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-01 17:56:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 17:56:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-01-01 17:56:17,459 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 10 [2019-01-01 17:56:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:17,460 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-01-01 17:56:17,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:56:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-01-01 17:56:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:56:17,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:17,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:17,462 INFO L423 AbstractCegarLoop]: === Iteration 6 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash 765213460, now seen corresponding path program 1 times [2019-01-01 17:56:17,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:17,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:17,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:17,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:56:17,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:56:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:56:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:56:17,541 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 3 states. [2019-01-01 17:56:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:17,657 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-01-01 17:56:17,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:56:17,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-01 17:56:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:17,659 INFO L225 Difference]: With dead ends: 110 [2019-01-01 17:56:17,659 INFO L226 Difference]: Without dead ends: 110 [2019-01-01 17:56:17,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:56:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-01 17:56:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-01 17:56:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 17:56:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-01-01 17:56:17,670 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 16 [2019-01-01 17:56:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:17,670 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-01-01 17:56:17,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:56:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-01-01 17:56:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:56:17,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:17,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:17,672 INFO L423 AbstractCegarLoop]: === Iteration 7 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash 765213461, now seen corresponding path program 1 times [2019-01-01 17:56:17,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:17,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:17,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:17,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:17,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:17,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:56:17,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:56:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:56:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:56:17,749 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 3 states. [2019-01-01 17:56:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:17,857 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-01 17:56:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:56:17,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-01 17:56:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:17,860 INFO L225 Difference]: With dead ends: 112 [2019-01-01 17:56:17,861 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 17:56:17,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:56:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 17:56:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2019-01-01 17:56:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 17:56:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-01-01 17:56:17,868 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 16 [2019-01-01 17:56:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:17,868 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-01-01 17:56:17,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:56:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-01-01 17:56:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:56:17,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:17,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:17,870 INFO L423 AbstractCegarLoop]: === Iteration 8 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:17,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash 765212597, now seen corresponding path program 1 times [2019-01-01 17:56:17,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:17,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:17,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:17,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:18,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:18,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:56:18,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:56:18,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:56:18,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:56:18,080 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 4 states. [2019-01-01 17:56:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:18,237 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-01-01 17:56:18,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:56:18,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-01 17:56:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:18,239 INFO L225 Difference]: With dead ends: 108 [2019-01-01 17:56:18,239 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 17:56:18,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:56:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 17:56:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-01-01 17:56:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 17:56:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-01-01 17:56:18,246 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 16 [2019-01-01 17:56:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:18,246 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-01-01 17:56:18,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:56:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-01-01 17:56:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:56:18,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:18,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:18,248 INFO L423 AbstractCegarLoop]: === Iteration 9 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2048203475, now seen corresponding path program 1 times [2019-01-01 17:56:18,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:18,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:18,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:18,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:18,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:18,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:56:18,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:56:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:56:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:56:18,331 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 4 states. [2019-01-01 17:56:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:18,620 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-01-01 17:56:18,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:56:18,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-01 17:56:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:18,623 INFO L225 Difference]: With dead ends: 116 [2019-01-01 17:56:18,623 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 17:56:18,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:56:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 17:56:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2019-01-01 17:56:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 17:56:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-01-01 17:56:18,628 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 17 [2019-01-01 17:56:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:18,628 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-01-01 17:56:18,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:56:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-01-01 17:56:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:56:18,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:18,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:18,630 INFO L423 AbstractCegarLoop]: === Iteration 10 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:18,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2048203474, now seen corresponding path program 1 times [2019-01-01 17:56:18,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:18,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:18,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:18,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:18,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:56:18,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:56:18,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:56:18,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:56:18,708 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 4 states. [2019-01-01 17:56:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:18,879 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-01-01 17:56:18,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:56:18,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-01 17:56:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:18,883 INFO L225 Difference]: With dead ends: 113 [2019-01-01 17:56:18,883 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 17:56:18,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:56:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 17:56:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2019-01-01 17:56:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 17:56:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-01 17:56:18,888 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2019-01-01 17:56:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:18,889 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-01 17:56:18,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:56:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-01 17:56:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 17:56:18,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:18,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:18,891 INFO L423 AbstractCegarLoop]: === Iteration 11 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1228513906, now seen corresponding path program 1 times [2019-01-01 17:56:18,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:18,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:18,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:18,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:18,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:56:18,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:56:18,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:56:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:56:18,950 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 4 states. [2019-01-01 17:56:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:19,103 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2019-01-01 17:56:19,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:56:19,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-01 17:56:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:19,127 INFO L225 Difference]: With dead ends: 118 [2019-01-01 17:56:19,127 INFO L226 Difference]: Without dead ends: 118 [2019-01-01 17:56:19,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:56:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-01 17:56:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-01-01 17:56:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 17:56:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-01-01 17:56:19,133 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 19 [2019-01-01 17:56:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:19,133 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-01-01 17:56:19,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:56:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-01-01 17:56:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 17:56:19,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:19,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:19,136 INFO L423 AbstractCegarLoop]: === Iteration 12 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1228513905, now seen corresponding path program 1 times [2019-01-01 17:56:19,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:19,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:19,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:19,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:19,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:19,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:19,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:56:19,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:56:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:56:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:56:19,498 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 7 states. [2019-01-01 17:56:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:19,874 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-01-01 17:56:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:56:19,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-01 17:56:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:19,877 INFO L225 Difference]: With dead ends: 109 [2019-01-01 17:56:19,877 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 17:56:19,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:56:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 17:56:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-01 17:56:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 17:56:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-01-01 17:56:19,882 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 19 [2019-01-01 17:56:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:19,882 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-01-01 17:56:19,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:56:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-01-01 17:56:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:56:19,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:19,883 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] [2019-01-01 17:56:19,884 INFO L423 AbstractCegarLoop]: === Iteration 13 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash 41200477, now seen corresponding path program 1 times [2019-01-01 17:56:19,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:19,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:19,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:20,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:20,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:56:20,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:56:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:56:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:56:20,156 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 5 states. [2019-01-01 17:56:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:20,466 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2019-01-01 17:56:20,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:56:20,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 17:56:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:20,474 INFO L225 Difference]: With dead ends: 124 [2019-01-01 17:56:20,475 INFO L226 Difference]: Without dead ends: 124 [2019-01-01 17:56:20,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-01 17:56:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2019-01-01 17:56:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 17:56:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2019-01-01 17:56:20,481 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 21 [2019-01-01 17:56:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:20,482 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2019-01-01 17:56:20,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:56:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2019-01-01 17:56:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:56:20,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:20,483 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] [2019-01-01 17:56:20,484 INFO L423 AbstractCegarLoop]: === Iteration 14 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:20,484 INFO L82 PathProgramCache]: Analyzing trace with hash 41200478, now seen corresponding path program 1 times [2019-01-01 17:56:20,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:20,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:20,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:20,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:20,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:56:20,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:56:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:56:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:20,862 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 6 states. [2019-01-01 17:56:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:21,239 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2019-01-01 17:56:21,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:56:21,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-01 17:56:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:21,242 INFO L225 Difference]: With dead ends: 119 [2019-01-01 17:56:21,243 INFO L226 Difference]: Without dead ends: 119 [2019-01-01 17:56:21,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:56:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-01 17:56:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2019-01-01 17:56:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 17:56:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2019-01-01 17:56:21,248 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 21 [2019-01-01 17:56:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:21,248 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2019-01-01 17:56:21,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:56:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2019-01-01 17:56:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:56:21,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:21,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:21,250 INFO L423 AbstractCegarLoop]: === Iteration 15 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash 102968293, now seen corresponding path program 1 times [2019-01-01 17:56:21,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:21,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:21,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:21,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:21,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:21,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:21,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:56:21,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:56:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:56:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:56:21,389 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 7 states. [2019-01-01 17:56:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:21,784 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-01-01 17:56:21,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:56:21,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-01-01 17:56:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:21,787 INFO L225 Difference]: With dead ends: 130 [2019-01-01 17:56:21,788 INFO L226 Difference]: Without dead ends: 130 [2019-01-01 17:56:21,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-01 17:56:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2019-01-01 17:56:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 17:56:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2019-01-01 17:56:21,793 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 22 [2019-01-01 17:56:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:21,794 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2019-01-01 17:56:21,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:56:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2019-01-01 17:56:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:56:21,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:21,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:21,795 INFO L423 AbstractCegarLoop]: === Iteration 16 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:21,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash 102968294, now seen corresponding path program 1 times [2019-01-01 17:56:21,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:21,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:21,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:21,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:21,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:56:21,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:56:21,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:56:21,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:56:21,931 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2019-01-01 17:56:22,289 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 17:56:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:22,764 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-01-01 17:56:22,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:56:22,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-01 17:56:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:22,767 INFO L225 Difference]: With dead ends: 127 [2019-01-01 17:56:22,767 INFO L226 Difference]: Without dead ends: 127 [2019-01-01 17:56:22,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-01 17:56:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2019-01-01 17:56:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 17:56:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2019-01-01 17:56:22,776 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 22 [2019-01-01 17:56:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:22,776 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2019-01-01 17:56:22,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:56:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2019-01-01 17:56:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:56:22,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:22,777 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] [2019-01-01 17:56:22,783 INFO L423 AbstractCegarLoop]: === Iteration 17 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1095902608, now seen corresponding path program 1 times [2019-01-01 17:56:22,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:22,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:22,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:22,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:22,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:22,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:56:22,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:56:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:56:22,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:56:22,872 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 5 states. [2019-01-01 17:56:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:23,045 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-01-01 17:56:23,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:56:23,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-01-01 17:56:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:23,047 INFO L225 Difference]: With dead ends: 115 [2019-01-01 17:56:23,048 INFO L226 Difference]: Without dead ends: 115 [2019-01-01 17:56:23,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-01 17:56:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-01 17:56:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-01 17:56:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2019-01-01 17:56:23,053 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 24 [2019-01-01 17:56:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:23,053 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2019-01-01 17:56:23,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:56:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2019-01-01 17:56:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:56:23,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:23,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] [2019-01-01 17:56:23,054 INFO L423 AbstractCegarLoop]: === Iteration 18 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1095902609, now seen corresponding path program 1 times [2019-01-01 17:56:23,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:23,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:23,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:23,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:23,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:56:23,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:56:23,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:56:23,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:23,241 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 6 states. [2019-01-01 17:56:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:23,413 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-01-01 17:56:23,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:56:23,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-01 17:56:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:23,423 INFO L225 Difference]: With dead ends: 110 [2019-01-01 17:56:23,423 INFO L226 Difference]: Without dead ends: 110 [2019-01-01 17:56:23,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:56:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-01 17:56:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-01 17:56:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 17:56:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-01-01 17:56:23,427 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 24 [2019-01-01 17:56:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:23,427 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-01-01 17:56:23,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:56:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-01-01 17:56:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:56:23,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:23,428 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] [2019-01-01 17:56:23,428 INFO L423 AbstractCegarLoop]: === Iteration 19 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash 168285766, now seen corresponding path program 1 times [2019-01-01 17:56:23,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:23,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:23,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:23,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:23,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:23,776 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 17:56:24,018 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 17:56:24,252 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 17:56:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:24,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:24,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:56:24,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:56:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:56:24,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:24,289 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 8 states. [2019-01-01 17:56:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:24,634 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-01-01 17:56:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:56:24,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-01 17:56:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:24,637 INFO L225 Difference]: With dead ends: 123 [2019-01-01 17:56:24,637 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 17:56:24,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:56:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 17:56:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2019-01-01 17:56:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 17:56:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-01-01 17:56:24,642 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 24 [2019-01-01 17:56:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:24,642 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-01-01 17:56:24,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:56:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-01-01 17:56:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:56:24,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:24,643 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] [2019-01-01 17:56:24,643 INFO L423 AbstractCegarLoop]: === Iteration 20 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash 168285767, now seen corresponding path program 1 times [2019-01-01 17:56:24,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:24,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:24,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:24,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:24,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:25,231 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-01 17:56:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:25,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:56:25,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:56:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:56:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:56:25,463 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 9 states. [2019-01-01 17:56:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:26,387 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2019-01-01 17:56:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:56:26,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-01-01 17:56:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:26,390 INFO L225 Difference]: With dead ends: 122 [2019-01-01 17:56:26,390 INFO L226 Difference]: Without dead ends: 122 [2019-01-01 17:56:26,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:56:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-01 17:56:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2019-01-01 17:56:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 17:56:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-01 17:56:26,396 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 24 [2019-01-01 17:56:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:26,396 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-01 17:56:26,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:56:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-01 17:56:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:56:26,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:26,397 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:26,397 INFO L423 AbstractCegarLoop]: === Iteration 21 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash 895542511, now seen corresponding path program 1 times [2019-01-01 17:56:26,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:26,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:26,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:26,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:26,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:26,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:56:26,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:56:26,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:26,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:56:27,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:56:27,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:56:27,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:27,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:56:27,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2019-01-01 17:56:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:27,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:56:27,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-01-01 17:56:27,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 17:56:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 17:56:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:56:27,292 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 15 states. [2019-01-01 17:56:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:28,401 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-01-01 17:56:28,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:56:28,402 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-01-01 17:56:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:28,403 INFO L225 Difference]: With dead ends: 113 [2019-01-01 17:56:28,404 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 17:56:28,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-01-01 17:56:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 17:56:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2019-01-01 17:56:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 17:56:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-01-01 17:56:28,410 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 26 [2019-01-01 17:56:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:28,411 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-01-01 17:56:28,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 17:56:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-01-01 17:56:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:56:28,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:28,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:28,414 INFO L423 AbstractCegarLoop]: === Iteration 22 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1988250585, now seen corresponding path program 1 times [2019-01-01 17:56:28,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:28,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:28,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:28,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:28,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:28,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:28,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:56:28,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:56:28,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:56:28,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:28,529 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 6 states. [2019-01-01 17:56:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:28,808 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-01-01 17:56:28,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:56:28,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-01 17:56:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:28,812 INFO L225 Difference]: With dead ends: 130 [2019-01-01 17:56:28,812 INFO L226 Difference]: Without dead ends: 130 [2019-01-01 17:56:28,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-01 17:56:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2019-01-01 17:56:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 17:56:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-01-01 17:56:28,817 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 27 [2019-01-01 17:56:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:28,817 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-01-01 17:56:28,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:56:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-01-01 17:56:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:56:28,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:28,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:28,818 INFO L423 AbstractCegarLoop]: === Iteration 23 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:28,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:28,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1988251549, now seen corresponding path program 1 times [2019-01-01 17:56:28,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:28,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:28,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:28,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:28,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:29,089 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 17:56:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:29,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:29,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:56:29,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:56:29,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:56:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:56:29,467 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 7 states. [2019-01-01 17:56:29,933 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 17:56:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:30,214 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-01-01 17:56:30,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:56:30,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-01 17:56:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:30,216 INFO L225 Difference]: With dead ends: 118 [2019-01-01 17:56:30,217 INFO L226 Difference]: Without dead ends: 118 [2019-01-01 17:56:30,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:56:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-01 17:56:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2019-01-01 17:56:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 17:56:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-01 17:56:30,223 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 27 [2019-01-01 17:56:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:30,223 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-01 17:56:30,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:56:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-01 17:56:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:56:30,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:30,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:30,227 INFO L423 AbstractCegarLoop]: === Iteration 24 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1988251550, now seen corresponding path program 1 times [2019-01-01 17:56:30,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:30,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:30,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:30,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:56:30,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:56:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:56:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:56:30,355 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 7 states. [2019-01-01 17:56:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:30,758 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-01-01 17:56:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:56:30,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-01 17:56:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:30,761 INFO L225 Difference]: With dead ends: 141 [2019-01-01 17:56:30,761 INFO L226 Difference]: Without dead ends: 141 [2019-01-01 17:56:30,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:56:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-01 17:56:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 120. [2019-01-01 17:56:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 17:56:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2019-01-01 17:56:30,766 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 27 [2019-01-01 17:56:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:30,768 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2019-01-01 17:56:30,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:56:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2019-01-01 17:56:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:56:30,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:30,769 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:30,773 INFO L423 AbstractCegarLoop]: === Iteration 25 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1821505919, now seen corresponding path program 1 times [2019-01-01 17:56:30,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:30,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:30,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:31,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:56:31,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:56:31,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:31,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:56:31,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:56:31,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 17:56:31,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:56:31,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:56:31,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-01 17:56:31,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-01-01 17:56:31,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 17:56:31,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 17:56:31,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2019-01-01 17:56:31,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2019-01-01 17:56:31,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2019-01-01 17:56:31,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27 [2019-01-01 17:56:31,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-01-01 17:56:31,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2019-01-01 17:56:31,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:31,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:56:31,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2019-01-01 17:56:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 17:56:31,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:56:31,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-01-01 17:56:31,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:56:31,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:56:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:56:31,446 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 12 states. [2019-01-01 17:56:31,892 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 17:56:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:32,661 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-01-01 17:56:32,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:56:32,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-01 17:56:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:32,665 INFO L225 Difference]: With dead ends: 119 [2019-01-01 17:56:32,665 INFO L226 Difference]: Without dead ends: 119 [2019-01-01 17:56:32,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:56:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-01 17:56:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-01 17:56:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 17:56:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2019-01-01 17:56:32,673 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 27 [2019-01-01 17:56:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:32,673 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2019-01-01 17:56:32,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:56:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2019-01-01 17:56:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:56:32,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:32,676 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:32,677 INFO L423 AbstractCegarLoop]: === Iteration 26 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:32,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1821505918, now seen corresponding path program 1 times [2019-01-01 17:56:32,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:32,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:32,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:33,240 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-01-01 17:56:34,028 WARN L181 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-01-01 17:56:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:34,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:56:34,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:56:34,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:34,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:56:34,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:56:34,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 17:56:34,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:56:34,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:56:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:56:34,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 17:56:34,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-01-01 17:56:34,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 17:56:34,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 17:56:34,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 17:56:34,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 17:56:34,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,413 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2019-01-01 17:56:34,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2019-01-01 17:56:34,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2019-01-01 17:56:34,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2019-01-01 17:56:34,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2019-01-01 17:56:34,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34 [2019-01-01 17:56:34,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-01-01 17:56:34,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2019-01-01 17:56:34,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-01 17:56:34,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-01-01 17:56:34,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:56:34,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12 [2019-01-01 17:56:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:34,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:56:34,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-01-01 17:56:34,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 17:56:34,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 17:56:34,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:56:34,965 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 14 states. [2019-01-01 17:56:35,333 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 17:56:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:36,339 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-01-01 17:56:36,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:56:36,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-01 17:56:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:36,348 INFO L225 Difference]: With dead ends: 127 [2019-01-01 17:56:36,348 INFO L226 Difference]: Without dead ends: 127 [2019-01-01 17:56:36,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-01 17:56:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-01 17:56:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-01 17:56:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-01 17:56:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2019-01-01 17:56:36,355 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 27 [2019-01-01 17:56:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:36,355 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2019-01-01 17:56:36,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 17:56:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2019-01-01 17:56:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:56:36,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:36,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:36,360 INFO L423 AbstractCegarLoop]: === Iteration 27 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash 107997591, now seen corresponding path program 1 times [2019-01-01 17:56:36,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:36,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:36,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:36,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:36,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:36,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:56:36,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:56:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:56:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:56:36,463 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 5 states. [2019-01-01 17:56:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:36,593 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2019-01-01 17:56:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:56:36,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-01 17:56:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:36,596 INFO L225 Difference]: With dead ends: 126 [2019-01-01 17:56:36,596 INFO L226 Difference]: Without dead ends: 126 [2019-01-01 17:56:36,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:56:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-01 17:56:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-01 17:56:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 17:56:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2019-01-01 17:56:36,601 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 30 [2019-01-01 17:56:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:36,601 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2019-01-01 17:56:36,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:56:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2019-01-01 17:56:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:56:36,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:36,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:36,602 INFO L423 AbstractCegarLoop]: === Iteration 28 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:36,602 INFO L82 PathProgramCache]: Analyzing trace with hash 107997592, now seen corresponding path program 1 times [2019-01-01 17:56:36,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:36,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:36,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:36,786 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 17:56:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:36,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:36,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:56:36,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:56:36,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:56:36,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:36,992 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 8 states. [2019-01-01 17:56:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:37,468 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2019-01-01 17:56:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:56:37,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-01 17:56:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:37,472 INFO L225 Difference]: With dead ends: 145 [2019-01-01 17:56:37,472 INFO L226 Difference]: Without dead ends: 145 [2019-01-01 17:56:37,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:56:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-01 17:56:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2019-01-01 17:56:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 17:56:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2019-01-01 17:56:37,480 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 30 [2019-01-01 17:56:37,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:37,480 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2019-01-01 17:56:37,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:56:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2019-01-01 17:56:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 17:56:37,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:37,481 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] [2019-01-01 17:56:37,481 INFO L423 AbstractCegarLoop]: === Iteration 29 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:37,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:37,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1644457898, now seen corresponding path program 1 times [2019-01-01 17:56:37,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:37,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:37,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:37,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:37,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:37,653 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 17:56:37,832 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 17:56:38,171 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 17:56:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:38,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:38,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:56:38,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:56:38,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:56:38,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:56:38,397 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 9 states. [2019-01-01 17:56:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:39,538 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2019-01-01 17:56:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:56:39,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-01-01 17:56:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:39,540 INFO L225 Difference]: With dead ends: 166 [2019-01-01 17:56:39,541 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 17:56:39,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:56:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 17:56:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 137. [2019-01-01 17:56:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-01 17:56:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2019-01-01 17:56:39,554 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 32 [2019-01-01 17:56:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:39,554 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2019-01-01 17:56:39,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:56:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2019-01-01 17:56:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 17:56:39,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:39,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:39,556 INFO L423 AbstractCegarLoop]: === Iteration 30 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:39,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:39,556 INFO L82 PathProgramCache]: Analyzing trace with hash 316594936, now seen corresponding path program 1 times [2019-01-01 17:56:39,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:39,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:39,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:39,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:39,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:39,953 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 17:56:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:40,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:40,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 17:56:40,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 17:56:40,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 17:56:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:56:40,354 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand 14 states. [2019-01-01 17:56:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:41,049 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2019-01-01 17:56:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 17:56:41,050 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-01-01 17:56:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:41,052 INFO L225 Difference]: With dead ends: 159 [2019-01-01 17:56:41,052 INFO L226 Difference]: Without dead ends: 159 [2019-01-01 17:56:41,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:56:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-01 17:56:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2019-01-01 17:56:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-01 17:56:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2019-01-01 17:56:41,059 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 34 [2019-01-01 17:56:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:41,059 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2019-01-01 17:56:41,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 17:56:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2019-01-01 17:56:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 17:56:41,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:41,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:56:41,060 INFO L423 AbstractCegarLoop]: === Iteration 31 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1648210464, now seen corresponding path program 1 times [2019-01-01 17:56:41,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:41,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:41,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:41,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:41,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:56:41,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:56:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:56:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:41,343 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 8 states. [2019-01-01 17:56:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:41,615 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2019-01-01 17:56:41,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:56:41,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-01-01 17:56:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:41,619 INFO L225 Difference]: With dead ends: 158 [2019-01-01 17:56:41,619 INFO L226 Difference]: Without dead ends: 158 [2019-01-01 17:56:41,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:56:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-01 17:56:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2019-01-01 17:56:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-01 17:56:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2019-01-01 17:56:41,630 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 35 [2019-01-01 17:56:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:41,630 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2019-01-01 17:56:41,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:56:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2019-01-01 17:56:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 17:56:41,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:41,631 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] [2019-01-01 17:56:41,632 INFO L423 AbstractCegarLoop]: === Iteration 32 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:41,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash -68521515, now seen corresponding path program 1 times [2019-01-01 17:56:41,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:41,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:41,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:41,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:41,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:56:41,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:56:41,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:56:41,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:56:41,977 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 7 states. [2019-01-01 17:56:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:42,150 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2019-01-01 17:56:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:56:42,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-01-01 17:56:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:42,154 INFO L225 Difference]: With dead ends: 155 [2019-01-01 17:56:42,154 INFO L226 Difference]: Without dead ends: 155 [2019-01-01 17:56:42,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-01 17:56:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2019-01-01 17:56:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-01 17:56:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2019-01-01 17:56:42,163 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 37 [2019-01-01 17:56:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:42,163 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 158 transitions. [2019-01-01 17:56:42,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:56:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2019-01-01 17:56:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 17:56:42,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:42,168 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] [2019-01-01 17:56:42,168 INFO L423 AbstractCegarLoop]: === Iteration 33 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:42,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2124166873, now seen corresponding path program 1 times [2019-01-01 17:56:42,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:42,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:42,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:42,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:42,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:42,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:56:42,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:56:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:56:42,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:42,313 INFO L87 Difference]: Start difference. First operand 149 states and 158 transitions. Second operand 6 states. [2019-01-01 17:56:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:42,447 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2019-01-01 17:56:42,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:56:42,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-01 17:56:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:42,450 INFO L225 Difference]: With dead ends: 163 [2019-01-01 17:56:42,450 INFO L226 Difference]: Without dead ends: 163 [2019-01-01 17:56:42,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-01 17:56:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2019-01-01 17:56:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-01 17:56:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2019-01-01 17:56:42,456 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 38 [2019-01-01 17:56:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:42,456 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2019-01-01 17:56:42,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:56:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2019-01-01 17:56:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-01 17:56:42,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:42,457 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] [2019-01-01 17:56:42,457 INFO L423 AbstractCegarLoop]: === Iteration 34 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:42,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:42,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1424663467, now seen corresponding path program 1 times [2019-01-01 17:56:42,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:42,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:42,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:42,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:42,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:42,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:56:42,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:56:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:56:42,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:42,782 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand 6 states. [2019-01-01 17:56:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:43,004 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2019-01-01 17:56:43,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:56:43,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-01 17:56:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:43,007 INFO L225 Difference]: With dead ends: 166 [2019-01-01 17:56:43,007 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 17:56:43,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 17:56:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2019-01-01 17:56:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-01 17:56:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2019-01-01 17:56:43,012 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 39 [2019-01-01 17:56:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:43,012 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2019-01-01 17:56:43,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:56:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2019-01-01 17:56:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-01 17:56:43,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:43,013 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] [2019-01-01 17:56:43,014 INFO L423 AbstractCegarLoop]: === Iteration 35 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash 911596352, now seen corresponding path program 1 times [2019-01-01 17:56:43,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:43,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:43,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:43,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:43,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:43,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:43,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 17:56:43,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 17:56:43,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 17:56:43,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:56:43,318 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 15 states. [2019-01-01 17:56:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:44,503 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2019-01-01 17:56:44,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 17:56:44,504 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-01-01 17:56:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:44,506 INFO L225 Difference]: With dead ends: 186 [2019-01-01 17:56:44,506 INFO L226 Difference]: Without dead ends: 186 [2019-01-01 17:56:44,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-01-01 17:56:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-01 17:56:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 163. [2019-01-01 17:56:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-01 17:56:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2019-01-01 17:56:44,512 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 39 [2019-01-01 17:56:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:44,512 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2019-01-01 17:56:44,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 17:56:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2019-01-01 17:56:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-01 17:56:44,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:44,513 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] [2019-01-01 17:56:44,513 INFO L423 AbstractCegarLoop]: === Iteration 36 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 911596353, now seen corresponding path program 1 times [2019-01-01 17:56:44,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:44,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:44,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:44,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:44,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 17:56:44,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 17:56:44,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 17:56:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:56:44,903 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand 15 states. [2019-01-01 17:56:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:45,967 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2019-01-01 17:56:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 17:56:45,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-01-01 17:56:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:45,971 INFO L225 Difference]: With dead ends: 205 [2019-01-01 17:56:45,971 INFO L226 Difference]: Without dead ends: 205 [2019-01-01 17:56:45,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:56:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-01 17:56:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2019-01-01 17:56:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-01 17:56:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2019-01-01 17:56:45,978 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 39 [2019-01-01 17:56:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:45,979 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2019-01-01 17:56:45,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 17:56:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2019-01-01 17:56:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 17:56:45,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:45,980 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] [2019-01-01 17:56:45,980 INFO L423 AbstractCegarLoop]: === Iteration 37 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:45,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1214894359, now seen corresponding path program 1 times [2019-01-01 17:56:45,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:45,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:45,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:46,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:46,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:56:46,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:56:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:56:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:46,160 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand 6 states. [2019-01-01 17:56:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:46,825 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2019-01-01 17:56:46,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:56:46,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-01-01 17:56:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:46,828 INFO L225 Difference]: With dead ends: 194 [2019-01-01 17:56:46,828 INFO L226 Difference]: Without dead ends: 194 [2019-01-01 17:56:46,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-01 17:56:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2019-01-01 17:56:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-01-01 17:56:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2019-01-01 17:56:46,836 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 40 [2019-01-01 17:56:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:46,836 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2019-01-01 17:56:46,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:56:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2019-01-01 17:56:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 17:56:46,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:46,837 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, 1] [2019-01-01 17:56:46,840 INFO L423 AbstractCegarLoop]: === Iteration 38 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:46,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash 992980696, now seen corresponding path program 1 times [2019-01-01 17:56:46,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:46,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:46,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:46,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:46,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:47,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:47,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:56:47,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:56:47,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:56:47,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:56:47,624 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand 8 states. [2019-01-01 17:56:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:47,986 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2019-01-01 17:56:47,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:56:47,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-01-01 17:56:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:47,988 INFO L225 Difference]: With dead ends: 196 [2019-01-01 17:56:47,988 INFO L226 Difference]: Without dead ends: 196 [2019-01-01 17:56:47,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:56:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-01 17:56:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2019-01-01 17:56:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-01 17:56:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 214 transitions. [2019-01-01 17:56:47,999 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 214 transitions. Word has length 41 [2019-01-01 17:56:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:48,000 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 214 transitions. [2019-01-01 17:56:48,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:56:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2019-01-01 17:56:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 17:56:48,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:48,006 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, 1, 1] [2019-01-01 17:56:48,007 INFO L423 AbstractCegarLoop]: === Iteration 39 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash 288702969, now seen corresponding path program 1 times [2019-01-01 17:56:48,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:48,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:48,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:48,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:48,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:48,300 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-01 17:56:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:48,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:48,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 17:56:48,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 17:56:48,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 17:56:48,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:56:48,553 INFO L87 Difference]: Start difference. First operand 189 states and 214 transitions. Second operand 15 states. [2019-01-01 17:56:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:49,745 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2019-01-01 17:56:49,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 17:56:49,746 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2019-01-01 17:56:49,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:49,748 INFO L225 Difference]: With dead ends: 223 [2019-01-01 17:56:49,748 INFO L226 Difference]: Without dead ends: 223 [2019-01-01 17:56:49,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-01-01 17:56:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-01 17:56:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2019-01-01 17:56:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-01 17:56:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2019-01-01 17:56:49,759 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 42 [2019-01-01 17:56:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:49,760 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2019-01-01 17:56:49,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 17:56:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2019-01-01 17:56:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 17:56:49,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:49,763 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, 1, 1] [2019-01-01 17:56:49,764 INFO L423 AbstractCegarLoop]: === Iteration 40 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash 288691984, now seen corresponding path program 1 times [2019-01-01 17:56:49,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:49,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:49,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:49,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:49,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:56:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:56:49,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:56:49,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:56:49,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:56:49,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:56:49,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:56:49,980 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand 5 states. [2019-01-01 17:56:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:56:50,089 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2019-01-01 17:56:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:56:50,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-01 17:56:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:56:50,092 INFO L225 Difference]: With dead ends: 209 [2019-01-01 17:56:50,092 INFO L226 Difference]: Without dead ends: 209 [2019-01-01 17:56:50,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:56:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-01 17:56:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2019-01-01 17:56:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-01 17:56:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 229 transitions. [2019-01-01 17:56:50,098 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 229 transitions. Word has length 42 [2019-01-01 17:56:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:56:50,099 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 229 transitions. [2019-01-01 17:56:50,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:56:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 229 transitions. [2019-01-01 17:56:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 17:56:50,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:56:50,099 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, 1, 1, 1] [2019-01-01 17:56:50,100 INFO L423 AbstractCegarLoop]: === Iteration 41 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2019-01-01 17:56:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:56:50,100 INFO L82 PathProgramCache]: Analyzing trace with hash 359516961, now seen corresponding path program 1 times [2019-01-01 17:56:50,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:56:50,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:56:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:50,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:56:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:56:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:56:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:56:50,159 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 17:56:50,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:56:50 BoogieIcfgContainer [2019-01-01 17:56:50,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:56:50,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:56:50,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:56:50,229 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:56:50,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:56:15" (3/4) ... [2019-01-01 17:56:50,241 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 17:56:50,334 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:56:50,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:56:50,340 INFO L168 Benchmark]: Toolchain (without parser) took 37275.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.2 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -90.0 MB). Peak memory consumption was 259.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:56:50,347 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:56:50,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:56:50,348 INFO L168 Benchmark]: Boogie Preprocessor took 91.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:56:50,349 INFO L168 Benchmark]: RCFGBuilder took 1181.50 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:56:50,349 INFO L168 Benchmark]: TraceAbstraction took 35211.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.4 MB). Peak memory consumption was 214.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:56:50,349 INFO L168 Benchmark]: Witness Printer took 110.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:56:50,358 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.33 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 675.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.11 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 1181.50 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35211.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.4 MB). Peak memory consumption was 214.8 MB. Max. memory is 11.5 GB. * Witness Printer took 110.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 560]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L571] struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; VAL [dataNotFinished=0, list={-1:0}] [L574] CALL append(&list) VAL [pointerToList={-1:0}] [L565] struct node_t *node = malloc(sizeof *node); VAL [malloc(sizeof *node)={2:0}, node={2:0}, pointerToList={-1:0}, pointerToList={-1:0}] [L566] EXPR \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={2:0}, node={2:0}, pointerToList={-1:0}, pointerToList={-1:0}] [L566] node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={2:0}, node={2:0}, pointerToList={-1:0}, pointerToList={-1:0}] [L567] CALL, EXPR create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] Data data = malloc(sizeof *data); [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] data->array = ((void *)0) VAL [data={3:0}, malloc(sizeof *data)={3:0}] [L552] data->number = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, data={3:0}, malloc(sizeof *data)={3:0}] [L553] return data; VAL [\result={3:0}, data={3:0}, malloc(sizeof *data)={3:0}] [L567] RET, EXPR create_data() VAL [create_data()={3:0}, malloc(sizeof *node)={2:0}, node={2:0}, pointerToList={-1:0}, pointerToList={-1:0}] [L567] node->data = create_data() VAL [create_data()={3:0}, malloc(sizeof *node)={2:0}, node={2:0}, pointerToList={-1:0}, pointerToList={-1:0}] [L568] *pointerToList = node VAL [malloc(sizeof *node)={2:0}, node={2:0}, pointerToList={-1:0}, pointerToList={-1:0}] [L574] RET append(&list) VAL [dataNotFinished=0, list={-1:0}] [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] \read(*list) VAL [\read(*list)={2:0}, dataNotFinished=0, list={-1:0}] [L576] COND TRUE \read(*list) [L577] EXPR \read(*list) VAL [\read(*list)={2:0}, dataNotFinished=0, list={-1:0}] [L577] EXPR list->next VAL [\read(*list)={2:0}, dataNotFinished=0, list={-1:0}, list->next={0:0}] [L577] struct node_t *next = list->next; [L578] EXPR \read(*list) VAL [\read(*list)={2:0}, dataNotFinished=0, list={-1:0}, next={0:0}] [L578] EXPR list->data VAL [\read(*list)={2:0}, dataNotFinished=0, list={-1:0}, list->data={3:0}, next={0:0}] [L578] CALL freeData(list->data) VAL [data={3:0}] [L556] COND FALSE !(data == ((void *)0)) VAL [data={3:0}, data={3:0}] [L559] EXPR data->array VAL [data={3:0}, data={3:0}, data->array={0:0}] [L559] COND TRUE data->array == ((void *)0) [L560] EXPR data->array VAL [data={3:0}, data={3:0}, data->array={0:0}] [L560] free(data->array) VAL [data={3:0}, data={3:0}, data->array={0:0}] [L560] free(data->array) VAL [data={3:0}, data={3:0}, data->array={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 120 locations, 46 error locations. UNSAFE Result, 35.1s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3460 SDtfs, 1803 SDslu, 9174 SDs, 0 SdLazy, 8855 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=39, 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.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 355 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 1150 NumberOfCodeBlocks, 1150 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1064 ConstructedInterpolants, 3 QuantifiedInterpolants, 239392 SizeOfPredicates, 24 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 43 InterpolantComputations, 37 PerfectInterpolantSequences, 6/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...