./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-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 37ce12f320cb92b62d01decbfb4f63ee1143a42a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:44:19,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:44:19,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:44:19,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:44:19,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:44:19,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:44:19,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:44:19,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:44:19,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:44:19,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:44:19,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:44:19,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:44:19,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:44:19,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:44:19,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:44:19,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:44:19,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:44:19,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:44:19,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:44:19,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:44:19,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:44:19,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:44:19,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:44:19,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:44:19,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:44:19,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:44:19,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:44:19,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:44:19,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:44:19,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:44:19,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:44:19,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:44:19,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:44:19,414 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:44:19,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:44:19,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:44:19,417 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:44:19,433 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:44:19,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:44:19,434 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:44:19,434 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:44:19,435 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:44:19,435 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:44:19,436 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:44:19,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:44:19,436 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:44:19,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:44:19,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:44:19,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:44:19,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:44:19,437 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:44:19,437 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:44:19,437 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:44:19,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:44:19,439 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:44:19,439 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:44:19,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:44:19,440 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:44:19,440 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:44:19,440 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:44:19,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:44:19,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:44:19,441 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:44:19,442 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:44:19,442 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:44:19,442 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 -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2018-11-28 22:44:19,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:44:19,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:44:19,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:44:19,501 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:44:19,501 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:44:19,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:19,568 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5ac1801/0c277dd66fed46188aaa68eb5488da75/FLAGb3859f42c [2018-11-28 22:44:20,131 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:44:20,132 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:20,145 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5ac1801/0c277dd66fed46188aaa68eb5488da75/FLAGb3859f42c [2018-11-28 22:44:20,420 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5ac1801/0c277dd66fed46188aaa68eb5488da75 [2018-11-28 22:44:20,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:44:20,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:44:20,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:44:20,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:44:20,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:44:20,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:20,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3613db22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20, skipping insertion in model container [2018-11-28 22:44:20,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:20,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:44:20,495 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:44:20,845 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:44:20,856 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:44:20,905 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:44:20,962 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:44:20,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20 WrapperNode [2018-11-28 22:44:20,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:44:20,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:44:20,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:44:20,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:44:21,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:21,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:21,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:21,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:21,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:21,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:21,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (1/1) ... [2018-11-28 22:44:21,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:44:21,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:44:21,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:44:21,116 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:44:21,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:44:21,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:44:21,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:44:21,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:44:21,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:44:21,175 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-11-28 22:44:21,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:44:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:44:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:44:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:44:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:44:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:44:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:44:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:44:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:44:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:44:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:44:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:44:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:44:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:44:21,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:44:21,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:44:21,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:44:21,179 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:44:21,179 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:44:21,179 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:44:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:44:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:44:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:44:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:44:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:44:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:44:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:44:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:44:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:44:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:44:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:44:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:44:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:44:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:44:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:44:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:44:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:44:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:44:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:44:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:44:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:44:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:44:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:44:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:44:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:44:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:44:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:44:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:44:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:44:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:44:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:44:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:44:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:44:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:44:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:44:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:44:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:44:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:44:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:44:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:44:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:44:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:44:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:44:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:44:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:44:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:44:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:44:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:44:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:44:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:44:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:44:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:44:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:44:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:44:21,193 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:44:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:44:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:44:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:44:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:44:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:44:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:44:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:44:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:44:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:44:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:44:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:44:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:44:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:44:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:44:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:44:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:44:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:44:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:44:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:44:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:44:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:44:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:44:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:44:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:44:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:44:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:44:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:44:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:44:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:44:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-11-28 22:44:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:44:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:44:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:44:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:44:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:44:21,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:44:21,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:44:21,934 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:44:21,934 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 22:44:21,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:21 BoogieIcfgContainer [2018-11-28 22:44:21,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:44:21,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:44:21,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:44:21,941 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:44:21,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:44:20" (1/3) ... [2018-11-28 22:44:21,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dd8a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:44:21, skipping insertion in model container [2018-11-28 22:44:21,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:20" (2/3) ... [2018-11-28 22:44:21,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dd8a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:44:21, skipping insertion in model container [2018-11-28 22:44:21,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:21" (3/3) ... [2018-11-28 22:44:21,944 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:21,955 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:44:21,964 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-28 22:44:21,982 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-28 22:44:22,011 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:44:22,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:44:22,012 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:44:22,012 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:44:22,012 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:44:22,012 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:44:22,012 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:44:22,013 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:44:22,013 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:44:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-28 22:44:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:44:22,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:22,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:22,044 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:22,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash -339131128, now seen corresponding path program 1 times [2018-11-28 22:44:22,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:22,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:22,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:22,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:22,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:22,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:22,291 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-28 22:44:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:22,499 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-28 22:44:22,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:22,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:44:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:22,512 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:44:22,512 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 22:44:22,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 22:44:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-28 22:44:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 22:44:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-28 22:44:22,567 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 10 [2018-11-28 22:44:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:22,567 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-28 22:44:22,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-28 22:44:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:44:22,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:22,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:22,569 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:22,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:22,569 INFO L82 PathProgramCache]: Analyzing trace with hash -339131127, now seen corresponding path program 1 times [2018-11-28 22:44:22,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:22,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:22,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:22,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:22,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:22,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:22,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:22,710 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-11-28 22:44:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:22,820 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-28 22:44:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:22,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:44:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:22,822 INFO L225 Difference]: With dead ends: 34 [2018-11-28 22:44:22,822 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 22:44:22,823 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 [2018-11-28 22:44:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 22:44:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-28 22:44:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 22:44:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 22:44:22,829 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2018-11-28 22:44:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:22,829 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 22:44:22,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 22:44:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:44:22,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:22,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:22,831 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:22,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1923130343, now seen corresponding path program 1 times [2018-11-28 22:44:22,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:22,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:22,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:22,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:22,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:22,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:22,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:22,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:22,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:22,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:22,980 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2018-11-28 22:44:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:23,080 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-28 22:44:23,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:23,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 22:44:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:23,082 INFO L225 Difference]: With dead ends: 33 [2018-11-28 22:44:23,082 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 22:44:23,083 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 [2018-11-28 22:44:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 22:44:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 22:44:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 22:44:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-28 22:44:23,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 11 [2018-11-28 22:44:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:23,088 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-28 22:44:23,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-28 22:44:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:44:23,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:23,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:23,090 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:23,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:23,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1923130344, now seen corresponding path program 1 times [2018-11-28 22:44:23,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:23,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:23,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:23,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:23,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:23,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:23,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:23,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:23,154 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-28 22:44:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:23,202 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-28 22:44:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:23,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 22:44:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:23,204 INFO L225 Difference]: With dead ends: 32 [2018-11-28 22:44:23,205 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 22:44:23,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 22:44:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-28 22:44:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 22:44:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-28 22:44:23,210 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2018-11-28 22:44:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:23,210 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-28 22:44:23,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-28 22:44:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:44:23,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:23,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:23,212 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:23,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash -675861453, now seen corresponding path program 1 times [2018-11-28 22:44:23,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:23,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:23,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:23,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:23,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:23,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:23,328 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-28 22:44:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:23,734 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-28 22:44:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:23,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 22:44:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:23,736 INFO L225 Difference]: With dead ends: 31 [2018-11-28 22:44:23,736 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 22:44:23,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 22:44:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-28 22:44:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 22:44:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-28 22:44:23,745 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2018-11-28 22:44:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:23,745 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 22:44:23,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-28 22:44:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:44:23,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:23,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:23,749 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:23,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash -675861452, now seen corresponding path program 1 times [2018-11-28 22:44:23,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:23,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:23,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:23,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:44:23,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:44:23,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:44:23,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:23,992 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2018-11-28 22:44:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:24,210 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-28 22:44:24,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:24,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 22:44:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:24,213 INFO L225 Difference]: With dead ends: 35 [2018-11-28 22:44:24,213 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 22:44:24,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 22:44:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-28 22:44:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 22:44:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-28 22:44:24,219 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-11-28 22:44:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:24,219 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-28 22:44:24,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:44:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-28 22:44:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 22:44:24,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:24,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:24,221 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:24,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1828195751, now seen corresponding path program 1 times [2018-11-28 22:44:24,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:24,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:24,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:24,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:24,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:24,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:24,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:24,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:24,358 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2018-11-28 22:44:24,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:24,608 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-28 22:44:24,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:24,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-28 22:44:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:24,612 INFO L225 Difference]: With dead ends: 37 [2018-11-28 22:44:24,612 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 22:44:24,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 22:44:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-28 22:44:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 22:44:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-28 22:44:24,618 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-28 22:44:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:24,619 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-28 22:44:24,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-28 22:44:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 22:44:24,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:24,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:24,620 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:24,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1828195750, now seen corresponding path program 1 times [2018-11-28 22:44:24,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:24,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:24,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:24,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:44:24,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:44:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:44:24,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:24,913 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2018-11-28 22:44:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:25,109 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-28 22:44:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:44:25,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-28 22:44:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:25,113 INFO L225 Difference]: With dead ends: 36 [2018-11-28 22:44:25,113 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 22:44:25,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-28 22:44:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 22:44:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 22:44:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 22:44:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 22:44:25,120 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2018-11-28 22:44:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:25,120 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 22:44:25,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:44:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 22:44:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:44:25,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:25,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:25,122 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:25,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash 663468183, now seen corresponding path program 1 times [2018-11-28 22:44:25,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:25,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:25,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:25,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:25,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:25,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:25,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:25,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:25,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:25,213 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2018-11-28 22:44:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:25,306 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-28 22:44:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:25,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-28 22:44:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:25,308 INFO L225 Difference]: With dead ends: 33 [2018-11-28 22:44:25,308 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 22:44:25,309 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 [2018-11-28 22:44:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 22:44:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 22:44:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 22:44:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-28 22:44:25,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2018-11-28 22:44:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:25,314 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-28 22:44:25,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-28 22:44:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:25,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:25,315 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, 1, 1] [2018-11-28 22:44:25,315 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:25,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash 245581310, now seen corresponding path program 1 times [2018-11-28 22:44:25,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:25,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:25,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:25,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:44:25,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:44:25,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:44:25,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:25,521 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-11-28 22:44:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:25,723 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-28 22:44:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:44:25,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-28 22:44:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:25,726 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:44:25,726 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 22:44:25,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:44:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 22:44:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 22:44:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 22:44:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-28 22:44:25,730 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-11-28 22:44:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:25,731 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-28 22:44:25,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:44:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-28 22:44:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:25,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:25,732 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, 1, 1] [2018-11-28 22:44:25,732 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:25,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1342766592, now seen corresponding path program 1 times [2018-11-28 22:44:25,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:25,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:25,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:25,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:26,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:26,079 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 [2018-11-28 22:44:26,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:26,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:26,212 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 [2018-11-28 22:44:26,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:26,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:26,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 22:44:26,267 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 14 treesize of output 11 [2018-11-28 22:44:26,275 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 [2018-11-28 22:44:26,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:26,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:26,294 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. [2018-11-28 22:44:26,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-11-28 22:44:26,394 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 25 treesize of output 26 [2018-11-28 22:44:26,400 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 [2018-11-28 22:44:26,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:26,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:26,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:26,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-11-28 22:44:26,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-28 22:44:26,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-28 22:44:26,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,038 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 [2018-11-28 22:44:27,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:27,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:27,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:27,065 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-11-28 22:44:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:27,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:27,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-11-28 22:44:27,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:44:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:44:27,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:44:27,193 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 20 states. [2018-11-28 22:44:27,798 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-11-28 22:44:30,384 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-11-28 22:44:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:30,595 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-28 22:44:30,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:44:30,595 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-11-28 22:44:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:30,596 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:44:30,596 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:44:30,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=119, Invalid=691, Unknown=2, NotChecked=0, Total=812 [2018-11-28 22:44:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:44:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-28 22:44:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:44:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 22:44:30,602 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 23 [2018-11-28 22:44:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:30,603 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 22:44:30,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:44:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 22:44:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:44:30,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:30,604 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, 1, 1, 1] [2018-11-28 22:44:30,604 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:30,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1323993511, now seen corresponding path program 1 times [2018-11-28 22:44:30,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:30,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:30,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:30,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:30,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:30,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 22:44:30,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:44:30,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:44:30,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:30,784 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-28 22:44:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:31,062 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-28 22:44:31,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:44:31,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-28 22:44:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:31,065 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:44:31,065 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:44:31,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:44:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:44:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-28 22:44:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 22:44:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-11-28 22:44:31,079 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 24 [2018-11-28 22:44:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:31,079 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-11-28 22:44:31,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:44:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-11-28 22:44:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:44:31,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:31,080 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, 1, 1, 1] [2018-11-28 22:44:31,086 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:31,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash -264354391, now seen corresponding path program 1 times [2018-11-28 22:44:31,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:31,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:31,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:31,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:31,451 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 [2018-11-28 22:44:31,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:31,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:31,553 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 [2018-11-28 22:44:31,571 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 [2018-11-28 22:44:31,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:31,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:31,692 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. [2018-11-28 22:44:31,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:44:32,312 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 [2018-11-28 22:44:32,320 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 [2018-11-28 22:44:32,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:32,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:32,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:32,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-11-28 22:44:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:32,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-11-28 22:44:32,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:44:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:44:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:44:32,484 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 20 states. [2018-11-28 22:44:33,505 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-11-28 22:44:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:34,607 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-28 22:44:34,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:44:34,609 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-11-28 22:44:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:34,610 INFO L225 Difference]: With dead ends: 83 [2018-11-28 22:44:34,610 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 22:44:34,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2018-11-28 22:44:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 22:44:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2018-11-28 22:44:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 22:44:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-28 22:44:34,617 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-11-28 22:44:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:34,618 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-28 22:44:34,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:44:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-28 22:44:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:44:34,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:34,619 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:34,619 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:34,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1666919290, now seen corresponding path program 2 times [2018-11-28 22:44:34,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:34,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:34,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:35,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:35,129 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 [2018-11-28 22:44:35,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:35,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:35,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:35,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:35,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:35,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:35,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:35,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 22:44:35,348 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 16 treesize of output 13 [2018-11-28 22:44:35,362 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 [2018-11-28 22:44:35,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:35,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:35,485 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. [2018-11-28 22:44:35,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-11-28 22:44:35,873 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 [2018-11-28 22:44:35,883 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 [2018-11-28 22:44:35,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-11-28 22:44:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:36,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:36,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-28 22:44:36,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 22:44:36,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 22:44:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:44:36,064 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 24 states. [2018-11-28 22:44:37,219 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-11-28 22:44:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:37,884 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-28 22:44:37,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 22:44:37,885 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-28 22:44:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:37,886 INFO L225 Difference]: With dead ends: 82 [2018-11-28 22:44:37,887 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 22:44:37,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 22:44:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 22:44:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 57. [2018-11-28 22:44:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 22:44:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-28 22:44:37,894 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 29 [2018-11-28 22:44:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:37,894 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-28 22:44:37,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 22:44:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-28 22:44:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 22:44:37,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:37,896 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:37,896 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:37,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1321635786, now seen corresponding path program 2 times [2018-11-28 22:44:37,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:37,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:37,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:44:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:38,356 WARN L180 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-11-28 22:44:38,815 WARN L180 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-28 22:44:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:39,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:39,097 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 [2018-11-28 22:44:39,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:39,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:39,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:39,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:39,202 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 [2018-11-28 22:44:39,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,278 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 [2018-11-28 22:44:39,296 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 [2018-11-28 22:44:39,297 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,316 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-28 22:44:39,346 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 [2018-11-28 22:44:39,350 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 [2018-11-28 22:44:39,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,364 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. [2018-11-28 22:44:39,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-11-28 22:44:39,405 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 29 treesize of output 30 [2018-11-28 22:44:39,408 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 [2018-11-28 22:44:39,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:39,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-11-28 22:44:40,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-11-28 22:44:40,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-11-28 22:44:40,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:40,035 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 [2018-11-28 22:44:40,035 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:40,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:40,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:40,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-11-28 22:44:40,440 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-11-28 22:44:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:40,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:40,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-11-28 22:44:40,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 22:44:40,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 22:44:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-11-28 22:44:40,764 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 23 states. [2018-11-28 22:44:41,623 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-11-28 22:44:42,098 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2018-11-28 22:44:43,743 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2018-11-28 22:44:47,627 WARN L180 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2018-11-28 22:44:49,640 WARN L180 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-11-28 22:44:49,988 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2018-11-28 22:44:50,953 WARN L180 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-11-28 22:44:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:51,021 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-28 22:44:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 22:44:51,023 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-11-28 22:44:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:51,023 INFO L225 Difference]: With dead ends: 60 [2018-11-28 22:44:51,024 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:44:51,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 22:44:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:44:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:44:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:44:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:44:51,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-28 22:44:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:51,026 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:44:51,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 22:44:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:44:51,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:44:51,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:44:51 BoogieIcfgContainer [2018-11-28 22:44:51,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:44:51,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:44:51,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:44:51,032 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:44:51,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:21" (3/4) ... [2018-11-28 22:44:51,037 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:44:51,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:44:51,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-11-28 22:44:51,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:44:51,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:44:51,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:44:51,048 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 22:44:51,048 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 22:44:51,048 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 22:44:51,106 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:44:51,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:44:51,110 INFO L168 Benchmark]: Toolchain (without parser) took 30685.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -112.0 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:51,111 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:51,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:51,112 INFO L168 Benchmark]: Boogie Preprocessor took 151.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:51,114 INFO L168 Benchmark]: RCFGBuilder took 820.80 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.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:51,115 INFO L168 Benchmark]: TraceAbstraction took 29094.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 186.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:51,116 INFO L168 Benchmark]: Witness Printer took 74.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:51,120 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 535.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 151.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 820.80 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.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29094.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 186.1 MB. Max. memory is 11.5 GB. * Witness Printer took 74.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: 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, 45 locations, 9 error locations. SAFE Result, 29.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 382 SDtfs, 666 SDslu, 1655 SDs, 0 SdLazy, 1479 SolverSat, 155 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=13, 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, 15 MinimizatonAttempts, 50 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 374 ConstructedInterpolants, 39 QuantifiedInterpolants, 98279 SizeOfPredicates, 54 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 8/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...