./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:13:36,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:13:36,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:13:36,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:13:36,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:13:36,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:13:36,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:13:36,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:13:36,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:13:36,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:13:36,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:13:36,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:13:36,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:13:36,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:13:36,189 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:13:36,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:13:36,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:13:36,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:13:36,200 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:13:36,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:13:36,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:13:36,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:13:36,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:13:36,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:13:36,207 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:13:36,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:13:36,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:13:36,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:13:36,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:13:36,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:13:36,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:13:36,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:13:36,213 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:13:36,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:13:36,214 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:13:36,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:13:36,215 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:13:36,245 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:13:36,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:13:36,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:13:36,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:13:36,247 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:13:36,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:13:36,247 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:13:36,247 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:13:36,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:13:36,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:13:36,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:13:36,248 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:13:36,248 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:13:36,248 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:13:36,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:13:36,253 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:13:36,253 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:13:36,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:13:36,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:13:36,254 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:13:36,254 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:13:36,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:36,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:13:36,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:13:36,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:13:36,255 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:13:36,255 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 -> bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 [2019-01-01 17:13:36,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:13:36,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:13:36,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:13:36,332 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:13:36,333 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:13:36,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:36,398 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5392d873d/1dd7192e1369447891ce9ae942f68bfa/FLAG38c781c09 [2019-01-01 17:13:36,901 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:13:36,902 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:36,918 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5392d873d/1dd7192e1369447891ce9ae942f68bfa/FLAG38c781c09 [2019-01-01 17:13:37,217 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5392d873d/1dd7192e1369447891ce9ae942f68bfa [2019-01-01 17:13:37,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:13:37,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:13:37,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:37,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:13:37,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:13:37,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5653a1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37, skipping insertion in model container [2019-01-01 17:13:37,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:13:37,295 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:13:37,706 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:37,725 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:13:37,797 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:37,929 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:13:37,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37 WrapperNode [2019-01-01 17:13:37,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:37,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:13:37,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:13:37,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:13:37,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (1/1) ... [2019-01-01 17:13:37,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:13:37,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:13:37,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:13:37,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:13:37,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (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:13:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:13:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:13:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:13:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:13:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2019-01-01 17:13:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:13:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:13:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:13:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:13:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:13:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:13:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:13:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:13:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:13:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:13:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:13:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:13:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:13:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:13:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:13:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:13:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:13:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:13:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:13:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:13:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:13:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:13:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:13:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:13:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:13:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:13:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:13:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:13:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:13:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:13:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:13:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:13:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:13:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:13:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:13:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:13:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:13:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:13:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:13:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:13:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:13:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:13:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:13:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:13:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:13:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:13:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:13:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:13:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:13:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:13:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:13:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:13:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:13:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:13:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:13:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:13:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:13:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:13:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:13:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:13:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:13:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:13:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:13:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:13:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:13:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:13:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:13:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:13:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:13:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:13:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:13:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:13:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:13:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:13:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:13:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:13:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:13:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:13:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:13:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:13:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:13:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:13:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:13:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:13:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:13:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:13:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:13:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:13:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:13:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:13:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:13:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:13:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:13:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:13:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:13:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:13:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:13:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:13:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:13:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:13:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:13:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:13:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:13:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:13:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2019-01-01 17:13:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:13:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:13:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:13:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:13:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:13:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:13:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:13:38,779 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:13:38,779 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 17:13:38,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:38 BoogieIcfgContainer [2019-01-01 17:13:38,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:13:38,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:13:38,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:13:38,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:13:38,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:13:37" (1/3) ... [2019-01-01 17:13:38,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7632bae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:38, skipping insertion in model container [2019-01-01 17:13:38,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:37" (2/3) ... [2019-01-01 17:13:38,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7632bae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:38, skipping insertion in model container [2019-01-01 17:13:38,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:38" (3/3) ... [2019-01-01 17:13:38,788 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:38,799 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:13:38,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-01 17:13:38,825 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-01 17:13:38,851 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:13:38,852 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:13:38,852 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:13:38,852 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:13:38,853 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:13:38,853 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:13:38,853 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:13:38,853 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:13:38,853 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:13:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-01 17:13:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:38,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:38,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:38,883 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash 412779915, now seen corresponding path program 1 times [2019-01-01 17:13:38,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:38,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:38,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:39,116 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:13:39,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:39,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:39,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:39,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:39,143 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-01 17:13:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:39,273 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-01-01 17:13:39,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:39,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:13:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:39,285 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:13:39,285 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 17:13:39,287 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:13:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 17:13:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-01 17:13:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:13:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-01 17:13:39,322 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2019-01-01 17:13:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:39,322 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-01 17:13:39,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-01 17:13:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:39,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:39,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:39,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash 412779916, now seen corresponding path program 1 times [2019-01-01 17:13:39,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:39,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:39,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:39,470 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:13:39,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:39,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:39,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:39,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:39,473 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2019-01-01 17:13:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:39,498 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-01 17:13:39,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:39,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:39,501 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:13:39,501 INFO L226 Difference]: Without dead ends: 35 [2019-01-01 17:13:39,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-01 17:13:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-01 17:13:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 17:13:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-01-01 17:13:39,508 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2019-01-01 17:13:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:39,509 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-01-01 17:13:39,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-01-01 17:13:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:39,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:39,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:39,510 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:39,511 INFO L82 PathProgramCache]: Analyzing trace with hash 472169900, now seen corresponding path program 1 times [2019-01-01 17:13:39,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:39,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:39,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:39,743 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:13:39,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:39,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:39,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:39,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:39,745 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2019-01-01 17:13:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:39,993 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-01-01 17:13:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:39,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-01 17:13:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:39,999 INFO L225 Difference]: With dead ends: 37 [2019-01-01 17:13:40,000 INFO L226 Difference]: Without dead ends: 37 [2019-01-01 17:13:40,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-01 17:13:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-01-01 17:13:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 17:13:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-01-01 17:13:40,012 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 15 [2019-01-01 17:13:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:40,013 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-01-01 17:13:40,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-01-01 17:13:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:40,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:40,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:40,016 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash 472169901, now seen corresponding path program 1 times [2019-01-01 17:13:40,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:40,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:40,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:40,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:40,408 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:13:40,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:40,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:13:40,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:13:40,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:13:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:13:40,411 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 9 states. [2019-01-01 17:13:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:40,938 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-01-01 17:13:40,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:40,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-01 17:13:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:40,941 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:13:40,942 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:13:40,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:13:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:13:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-01 17:13:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:13:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-01 17:13:40,948 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 15 [2019-01-01 17:13:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:40,949 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-01 17:13:40,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:13:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-01 17:13:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:13:40,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:40,950 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:13:40,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1752364997, now seen corresponding path program 1 times [2019-01-01 17:13:40,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:40,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:40,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:41,116 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:13:41,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:41,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:41,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:41,118 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2019-01-01 17:13:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:41,279 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-01-01 17:13:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:41,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-01 17:13:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:41,282 INFO L225 Difference]: With dead ends: 38 [2019-01-01 17:13:41,282 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 17:13:41,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 17:13:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-01-01 17:13:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 17:13:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-01-01 17:13:41,287 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2019-01-01 17:13:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:41,288 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-01-01 17:13:41,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-01-01 17:13:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:13:41,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:41,289 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:13:41,289 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1752364998, now seen corresponding path program 1 times [2019-01-01 17:13:41,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:41,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:41,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:41,479 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:13:41,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:41,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:41,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:41,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:41,481 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 8 states. [2019-01-01 17:13:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:41,706 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-01-01 17:13:41,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:41,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-01 17:13:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:41,708 INFO L225 Difference]: With dead ends: 37 [2019-01-01 17:13:41,708 INFO L226 Difference]: Without dead ends: 37 [2019-01-01 17:13:41,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-01 17:13:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-01 17:13:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:13:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-01 17:13:41,716 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2019-01-01 17:13:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:41,716 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-01 17:13:41,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-01 17:13:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:41,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:41,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:41,718 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1695369597, now seen corresponding path program 1 times [2019-01-01 17:13:41,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:41,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:41,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:41,924 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:13:41,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:41,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:41,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:13:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:13:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:13:41,926 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-01-01 17:13:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:41,982 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-01-01 17:13:41,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:13:41,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-01 17:13:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:41,998 INFO L225 Difference]: With dead ends: 48 [2019-01-01 17:13:41,999 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 17:13:41,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:13:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 17:13:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-01-01 17:13:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 17:13:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-01-01 17:13:42,011 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2019-01-01 17:13:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:42,012 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-01-01 17:13:42,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:13:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-01-01 17:13:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:42,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:42,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:42,013 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1898533121, now seen corresponding path program 1 times [2019-01-01 17:13:42,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:42,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:42,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:42,110 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:13:42,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:42,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:42,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:42,112 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 4 states. [2019-01-01 17:13:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:42,210 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-01-01 17:13:42,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:42,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-01 17:13:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:42,213 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:13:42,213 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:13:42,213 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:13:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:13:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-01-01 17:13:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 17:13:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-01 17:13:42,217 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2019-01-01 17:13:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:42,217 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-01 17:13:42,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-01 17:13:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:42,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:42,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:42,219 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:42,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2098008373, now seen corresponding path program 1 times [2019-01-01 17:13:42,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:42,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:42,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:42,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:42,296 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:13:42,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:42,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:13:42,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:13:42,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:13:42,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:13:42,297 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2019-01-01 17:13:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:42,492 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-01 17:13:42,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:42,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-01 17:13:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:42,493 INFO L225 Difference]: With dead ends: 29 [2019-01-01 17:13:42,493 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 17:13:42,494 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:13:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 17:13:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 17:13:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:13:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-01 17:13:42,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-01-01 17:13:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:42,499 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-01 17:13:42,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:13:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-01 17:13:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:42,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:42,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:42,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2098008372, now seen corresponding path program 1 times [2019-01-01 17:13:42,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:42,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:42,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:42,824 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:13:42,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:42,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:42,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:42,825 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2019-01-01 17:13:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:43,069 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-01-01 17:13:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:43,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-01 17:13:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:43,071 INFO L225 Difference]: With dead ends: 63 [2019-01-01 17:13:43,071 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 17:13:43,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 17:13:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-01 17:13:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 17:13:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-01-01 17:13:43,086 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2019-01-01 17:13:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:43,086 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-01-01 17:13:43,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-01-01 17:13:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:43,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:43,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:43,092 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1610152910, now seen corresponding path program 1 times [2019-01-01 17:13:43,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:43,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:43,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:43,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:43,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:43,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:13:43,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:43,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:13:43,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:13:43,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:13:43,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:43,499 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2019-01-01 17:13:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:43,995 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-01-01 17:13:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:13:43,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-01 17:13:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:43,998 INFO L225 Difference]: With dead ends: 44 [2019-01-01 17:13:43,998 INFO L226 Difference]: Without dead ends: 44 [2019-01-01 17:13:43,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:13:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-01 17:13:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-01-01 17:13:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 17:13:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-01 17:13:44,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2019-01-01 17:13:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:44,004 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-01 17:13:44,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:13:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-01 17:13:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:13:44,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:44,005 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:44,005 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:44,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash -595711829, now seen corresponding path program 1 times [2019-01-01 17:13:44,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:44,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:44,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:44,645 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-01 17:13:45,012 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 5 [2019-01-01 17:13:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:45,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:45,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:45,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:45,031 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2019-01-01 17:13:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:45,102 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-01 17:13:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:45,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-01 17:13:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:45,104 INFO L225 Difference]: With dead ends: 44 [2019-01-01 17:13:45,104 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:13:45,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:13:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:13:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-01 17:13:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 17:13:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-01 17:13:45,108 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2019-01-01 17:13:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:45,108 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-01 17:13:45,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-01 17:13:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:13:45,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:45,109 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:45,109 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:45,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:45,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1606829079, now seen corresponding path program 1 times [2019-01-01 17:13:45,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:45,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:45,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:45,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:45,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:45,568 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 7 [2019-01-01 17:13:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:45,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:45,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:13:45,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:13:45,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:13:45,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:45,702 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2019-01-01 17:13:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:45,901 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-01-01 17:13:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:13:45,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-01-01 17:13:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:45,903 INFO L225 Difference]: With dead ends: 51 [2019-01-01 17:13:45,904 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 17:13:45,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:13:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 17:13:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-01 17:13:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:13:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-01 17:13:45,917 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-01-01 17:13:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:45,917 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-01 17:13:45,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:13:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-01 17:13:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:13:45,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:45,920 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:45,920 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1408274539, now seen corresponding path program 1 times [2019-01-01 17:13:45,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:45,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:45,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:46,404 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-01 17:13:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:46,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:46,548 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:13:46,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:46,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:46,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:13:46,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:13:46,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:46,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:46,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:46,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 17:13:47,272 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 20 treesize of output 16 [2019-01-01 17:13:47,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:47,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:47,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:47,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:47,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-01 17:13:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:47,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:47,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-01-01 17:13:47,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 17:13:47,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 17:13:47,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-01-01 17:13:47,391 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 18 states. [2019-01-01 17:13:48,467 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-01-01 17:13:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:48,938 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-01-01 17:13:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 17:13:48,939 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-01-01 17:13:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:48,940 INFO L225 Difference]: With dead ends: 50 [2019-01-01 17:13:48,940 INFO L226 Difference]: Without dead ends: 50 [2019-01-01 17:13:48,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=93, Invalid=506, Unknown=1, NotChecked=0, Total=600 [2019-01-01 17:13:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-01 17:13:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-01-01 17:13:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 17:13:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-01-01 17:13:48,945 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 21 [2019-01-01 17:13:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:48,945 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-01-01 17:13:48,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 17:13:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-01-01 17:13:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:13:48,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:48,947 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] [2019-01-01 17:13:48,947 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash 706837704, now seen corresponding path program 1 times [2019-01-01 17:13:48,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:48,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:48,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:48,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:48,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:49,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:49,570 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:13:49,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:49,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:49,684 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 5 treesize of output 1 [2019-01-01 17:13:49,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:49,692 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:49,734 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:13:49,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:49,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:49,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:49,794 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-01 17:13:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:50,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:50,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-01-01 17:13:50,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 17:13:50,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 17:13:50,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-01-01 17:13:50,046 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 21 states. [2019-01-01 17:13:50,503 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-01-01 17:13:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:50,885 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-01 17:13:50,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:13:50,887 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-01-01 17:13:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:50,887 INFO L225 Difference]: With dead ends: 49 [2019-01-01 17:13:50,887 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 17:13:50,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-01-01 17:13:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 17:13:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-01 17:13:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 17:13:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-01-01 17:13:50,892 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 22 [2019-01-01 17:13:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:50,893 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-01-01 17:13:50,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 17:13:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-01-01 17:13:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:13:50,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:50,894 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] [2019-01-01 17:13:50,894 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2142368762, now seen corresponding path program 1 times [2019-01-01 17:13:50,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:50,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:50,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:50,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:51,535 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 17:13:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:51,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:51,613 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:13:51,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:51,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:51,689 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 5 treesize of output 1 [2019-01-01 17:13:51,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:51,699 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:51,706 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:13:51,707 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:51,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:51,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:51,726 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-01 17:13:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:52,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:52,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-01-01 17:13:52,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:13:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:13:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:13:52,001 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 20 states. [2019-01-01 17:13:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:53,158 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-01-01 17:13:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 17:13:53,160 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-01-01 17:13:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:53,161 INFO L225 Difference]: With dead ends: 57 [2019-01-01 17:13:53,161 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 17:13:53,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 17:13:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 17:13:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-01 17:13:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 17:13:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-01 17:13:53,165 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2019-01-01 17:13:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:53,167 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-01 17:13:53,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:13:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-01 17:13:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:13:53,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:53,168 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] [2019-01-01 17:13:53,168 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:53,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash 267592398, now seen corresponding path program 1 times [2019-01-01 17:13:53,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:53,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:53,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:53,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:53,828 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 17:13:54,105 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 17:13:54,349 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:13:54,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:54,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:54,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:54,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:54,430 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 5 treesize of output 1 [2019-01-01 17:13:54,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,520 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:54,525 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:13:54,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:54,548 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-01 17:13:55,037 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:13:55,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:55,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-01-01 17:13:55,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:13:55,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:13:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:13:55,057 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2019-01-01 17:13:56,743 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-01 17:13:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:56,822 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-01 17:13:56,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 17:13:56,822 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-01-01 17:13:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:56,823 INFO L225 Difference]: With dead ends: 38 [2019-01-01 17:13:56,823 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:13:56,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 17:13:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:13:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-01 17:13:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 17:13:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-01 17:13:56,829 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-01-01 17:13:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:56,829 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-01 17:13:56,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:13:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-01 17:13:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:13:56,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:56,832 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:56,834 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash -276531991, now seen corresponding path program 2 times [2019-01-01 17:13:56,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:56,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:56,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:57,134 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-01 17:13:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:57,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:57,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:57,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:57,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:57,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:57,531 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 5 treesize of output 1 [2019-01-01 17:13:57,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:57,557 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:13:57,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,563 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,573 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2019-01-01 17:13:57,602 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 16 treesize of output 13 [2019-01-01 17:13:57,615 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 13 treesize of output 12 [2019-01-01 17:13:57,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:57,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-01-01 17:13:57,888 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 24 treesize of output 25 [2019-01-01 17:13:57,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 17:13:57,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:57,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:57,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2019-01-01 17:13:58,052 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 22 treesize of output 18 [2019-01-01 17:13:58,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-01 17:13:58,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:58,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:58,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:58,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-01 17:13:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:58,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:58,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-01-01 17:13:58,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 17:13:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 17:13:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:13:58,165 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 24 states. [2019-01-01 17:13:58,896 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-01-01 17:13:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:59,623 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-01 17:13:59,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:13:59,624 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-01-01 17:13:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:59,625 INFO L225 Difference]: With dead ends: 30 [2019-01-01 17:13:59,625 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 17:13:59,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 17:13:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 17:13:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-01 17:13:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:13:59,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-01 17:13:59,629 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-01 17:13:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:59,629 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-01 17:13:59,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 17:13:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-01 17:13:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:13:59,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:59,630 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:59,630 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:59,631 INFO L82 PathProgramCache]: Analyzing trace with hash 17442826, now seen corresponding path program 2 times [2019-01-01 17:13:59,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:59,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:59,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:59,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:13:59,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:59,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:59,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:14:00,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:14:00,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:14:00,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:00,037 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 5 treesize of output 1 [2019-01-01 17:14:00,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:00,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:14:00,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:14:00,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:00,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:00,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:00,073 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-01 17:14:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:00,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:00,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-01-01 17:14:00,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 17:14:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 17:14:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:14:00,499 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-01-01 17:14:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:01,477 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-01 17:14:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 17:14:01,479 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-01-01 17:14:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:01,479 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:14:01,479 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:14:01,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 17:14:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:14:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:14:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:14:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:14:01,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-01-01 17:14:01,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:01,482 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:14:01,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 17:14:01,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:14:01,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:14:01,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:14:01 BoogieIcfgContainer [2019-01-01 17:14:01,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:14:01,488 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:14:01,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:14:01,488 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:14:01,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:38" (3/4) ... [2019-01-01 17:14:01,492 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:14:01,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2019-01-01 17:14:01,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:14:01,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:14:01,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:14:01,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:14:01,508 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-01 17:14:01,509 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 17:14:01,509 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 17:14:01,565 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:14:01,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:14:01,566 INFO L168 Benchmark]: Toolchain (without parser) took 24345.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -322.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:01,568 INFO L168 Benchmark]: CDTParser took 0.16 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:14:01,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:01,570 INFO L168 Benchmark]: Boogie Preprocessor took 63.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:01,570 INFO L168 Benchmark]: RCFGBuilder took 783.82 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:01,571 INFO L168 Benchmark]: TraceAbstraction took 22706.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:01,572 INFO L168 Benchmark]: Witness Printer took 77.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:01,577 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 708.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 783.82 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22706.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Witness Printer took 77.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 9 error locations. SAFE Result, 22.6s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 674 SDslu, 2190 SDs, 0 SdLazy, 2186 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 60 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 491 ConstructedInterpolants, 21 QuantifiedInterpolants, 104553 SizeOfPredicates, 82 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 4/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...