./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/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/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 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:43:23,415 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:43:23,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:43:23,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:43:23,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:43:23,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:43:23,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:43:23,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:43:23,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:43:23,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:43:23,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:43:23,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:43:23,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:43:23,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:43:23,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:43:23,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:43:23,445 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:43:23,447 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:43:23,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:43:23,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:43:23,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:43:23,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:43:23,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:43:23,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:43:23,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:43:23,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:43:23,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:43:23,462 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:43:23,463 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:43:23,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:43:23,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:43:23,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:43:23,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:43:23,465 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:43:23,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:43:23,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:43:23,468 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:43:23,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:43:23,484 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:43:23,484 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:43:23,485 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:43:23,485 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:43:23,485 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:43:23,485 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:43:23,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:43:23,487 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:43:23,487 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:43:23,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:43:23,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:43:23,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:43:23,487 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:43:23,488 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:43:23,489 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:43:23,489 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:43:23,489 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:43:23,489 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:43:23,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:43:23,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:43:23,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:43:23,490 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:43:23,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:23,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:43:23,490 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:43:23,492 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:43:23,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:43:23,492 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 -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2018-11-28 22:43:23,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:43:23,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:43:23,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:43:23,562 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:43:23,563 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:43:23,565 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:23,630 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0760b422d/afaa6a8e394f437c8fa2eb597c407b26/FLAG39f0927ec [2018-11-28 22:43:24,106 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:43:24,108 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:24,124 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0760b422d/afaa6a8e394f437c8fa2eb597c407b26/FLAG39f0927ec [2018-11-28 22:43:24,423 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0760b422d/afaa6a8e394f437c8fa2eb597c407b26 [2018-11-28 22:43:24,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:43:24,429 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:43:24,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:24,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:43:24,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:43:24,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:24" (1/1) ... [2018-11-28 22:43:24,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a121da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:24, skipping insertion in model container [2018-11-28 22:43:24,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:24" (1/1) ... [2018-11-28 22:43:24,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:43:24,501 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:43:24,911 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:24,927 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:43:25,008 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:25,146 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:43:25,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25 WrapperNode [2018-11-28 22:43:25,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:25,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:43:25,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:43:25,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:43:25,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (1/1) ... [2018-11-28 22:43:25,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (1/1) ... [2018-11-28 22:43:25,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (1/1) ... [2018-11-28 22:43:25,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (1/1) ... [2018-11-28 22:43:25,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (1/1) ... [2018-11-28 22:43:25,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (1/1) ... [2018-11-28 22:43:25,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (1/1) ... [2018-11-28 22:43:25,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:43:25,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:43:25,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:43:25,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:43:25,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (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:43:25,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:43:25,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:43:25,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:43:25,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:43:25,301 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-11-28 22:43:25,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:43:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:43:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:43:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:43:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:43:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:43:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:43:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:43:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:43:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:43:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:43:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:43:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:43:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:43:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:43:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:43:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:43:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:43:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:43:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:43:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:43:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:43:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:43:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:43:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:43:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:43:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:43:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:43:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:43:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:43:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:43:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:43:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:43:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:43:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:43:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:43:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:43:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:43:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:43:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:43:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:43:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:43:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:43:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:43:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:43:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:43:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:43:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:43:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:43:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:43:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:43:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:43:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:43:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:43:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:43:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:43:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:43:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:43:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:43:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:43:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:43:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:43:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:43:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:43:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:43:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:43:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:43:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:43:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:43:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:43:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:43:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:43:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:43:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:43:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:43:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:43:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:43:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:43:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:43:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:43:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:43:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:43:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:43:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:43:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:43:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:43:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:43:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:43:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:43:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:43:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:43:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:43:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:43:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:43:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:43:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:43:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:43:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:43:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:43:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:43:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:43:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:43:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:43:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:43:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-11-28 22:43:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:43:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:43:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:43:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:43:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:43:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:43:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:43:26,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:43:26,110 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 22:43:26,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:26 BoogieIcfgContainer [2018-11-28 22:43:26,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:43:26,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:43:26,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:43:26,115 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:43:26,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:43:24" (1/3) ... [2018-11-28 22:43:26,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dd5b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:26, skipping insertion in model container [2018-11-28 22:43:26,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:25" (2/3) ... [2018-11-28 22:43:26,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dd5b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:26, skipping insertion in model container [2018-11-28 22:43:26,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:26" (3/3) ... [2018-11-28 22:43:26,119 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:26,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:43:26,138 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-11-28 22:43:26,155 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-11-28 22:43:26,185 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:43:26,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:43:26,186 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:43:26,186 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:43:26,188 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:43:26,188 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:43:26,188 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:43:26,188 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:43:26,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:43:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-28 22:43:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:26,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:26,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:26,219 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:26,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1879598342, now seen corresponding path program 1 times [2018-11-28 22:43:26,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:26,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:26,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:26,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:26,419 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:43:26,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:26,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:26,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:26,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:26,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:26,443 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-11-28 22:43:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:26,607 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-28 22:43:26,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:26,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:26,620 INFO L225 Difference]: With dead ends: 48 [2018-11-28 22:43:26,620 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 22:43:26,622 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:43:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 22:43:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 22:43:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:43:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-28 22:43:26,657 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-11-28 22:43:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:26,658 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-28 22:43:26,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-28 22:43:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:26,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:26,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:26,659 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:26,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1879598343, now seen corresponding path program 1 times [2018-11-28 22:43:26,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:26,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:26,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:26,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:26,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:26,819 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:43:26,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:26,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:26,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:26,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:26,822 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-11-28 22:43:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:26,858 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-28 22:43:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:26,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:26,862 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:43:26,862 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:43:26,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:43:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 22:43:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:43:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-28 22:43:26,877 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-11-28 22:43:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:26,880 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-28 22:43:26,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-28 22:43:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:43:26,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:26,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:26,881 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:26,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1861993495, now seen corresponding path program 1 times [2018-11-28 22:43:26,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:26,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:26,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:27,002 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:43:27,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:27,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:27,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:27,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:27,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:27,004 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-11-28 22:43:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:27,169 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-28 22:43:27,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:27,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 22:43:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:27,172 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:43:27,172 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:43:27,173 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:43:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:43:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:43:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:43:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-28 22:43:27,180 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-11-28 22:43:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:27,180 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-28 22:43:27,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-28 22:43:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:43:27,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:27,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:27,181 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:27,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1861993494, now seen corresponding path program 1 times [2018-11-28 22:43:27,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:27,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:27,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:27,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:27,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:27,310 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:43:27,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:27,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:27,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:27,312 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-28 22:43:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:27,349 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-28 22:43:27,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:27,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 22:43:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:27,352 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:43:27,352 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:43:27,353 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:43:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:43:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 22:43:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:43:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-28 22:43:27,358 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-11-28 22:43:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:27,359 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-28 22:43:27,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-28 22:43:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:27,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:27,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:27,360 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:27,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1145525834, now seen corresponding path program 1 times [2018-11-28 22:43:27,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:27,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:27,456 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:43:27,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:27,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:27,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:43:27,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:43:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:27,458 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-28 22:43:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:27,962 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-28 22:43:27,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:27,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 22:43:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:27,965 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:43:27,965 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:43:27,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:43:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:43:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:43:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-28 22:43:27,986 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-11-28 22:43:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:27,986 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 22:43:27,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:43:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-28 22:43:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:27,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:27,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:27,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:27,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1145525833, now seen corresponding path program 1 times [2018-11-28 22:43:27,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:27,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:27,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:28,187 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:43:28,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:28,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:28,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:43:28,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:43:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:28,189 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-11-28 22:43:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:28,459 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-28 22:43:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:28,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-28 22:43:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:28,463 INFO L225 Difference]: With dead ends: 62 [2018-11-28 22:43:28,463 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 22:43:28,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:43:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 22:43:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-28 22:43:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:43:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-28 22:43:28,471 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-11-28 22:43:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:28,471 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-28 22:43:28,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:43:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-28 22:43:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:28,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:28,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:28,476 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:28,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2000279356, now seen corresponding path program 1 times [2018-11-28 22:43:28,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:28,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:28,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:28,577 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:43:28,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:28,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:43:28,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:28,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:28,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:28,579 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-11-28 22:43:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:28,730 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-28 22:43:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:28,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 22:43:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:28,734 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:43:28,734 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:43:28,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:43:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-28 22:43:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:43:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-28 22:43:28,739 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-11-28 22:43:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:28,739 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-28 22:43:28,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-28 22:43:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:28,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:28,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:28,741 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:28,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:28,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2000279357, now seen corresponding path program 1 times [2018-11-28 22:43:28,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:28,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:28,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:28,919 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:43:28,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:28,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:43:28,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:43:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:43:28,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:28,921 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-11-28 22:43:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:29,128 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-28 22:43:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:43:29,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 22:43:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:29,131 INFO L225 Difference]: With dead ends: 55 [2018-11-28 22:43:29,131 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 22:43:29,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 22:43:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-28 22:43:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 22:43:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-28 22:43:29,137 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-11-28 22:43:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:29,137 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-28 22:43:29,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:43:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-28 22:43:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:43:29,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:29,138 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] [2018-11-28 22:43:29,139 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:29,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1894101213, now seen corresponding path program 1 times [2018-11-28 22:43:29,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:29,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:29,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:29,212 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:43:29,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:29,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:29,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:29,214 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-11-28 22:43:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:29,298 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-28 22:43:29,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:29,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-28 22:43:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:29,300 INFO L225 Difference]: With dead ends: 46 [2018-11-28 22:43:29,300 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:43:29,301 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:43:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:43:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:43:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:43:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-28 22:43:29,305 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-11-28 22:43:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:29,305 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-28 22:43:29,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-28 22:43:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:43:29,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:29,306 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:43:29,307 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:29,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 197301268, now seen corresponding path program 1 times [2018-11-28 22:43:29,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:29,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:29,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:29,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:29,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:29,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:29,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:29,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:29,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:29,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:29,348 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-28 22:43:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:29,361 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-28 22:43:29,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:29,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 22:43:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:29,363 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:43:29,363 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:43:29,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:43:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:43:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:43:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:43:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-28 22:43:29,368 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-11-28 22:43:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:29,368 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-28 22:43:29,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-28 22:43:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:43:29,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:29,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:29,370 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:29,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash 622097713, now seen corresponding path program 1 times [2018-11-28 22:43:29,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:29,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:29,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:29,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:43:29,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:43:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:43:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:29,750 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2018-11-28 22:43:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:30,108 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-28 22:43:30,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:43:30,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 22:43:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:30,111 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:43:30,111 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:43:30,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:43:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:43:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-28 22:43:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 22:43:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-28 22:43:30,117 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2018-11-28 22:43:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:30,118 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-28 22:43:30,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:43:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-28 22:43:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:43:30,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:30,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:30,119 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:30,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash -966250189, now seen corresponding path program 1 times [2018-11-28 22:43:30,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:30,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:30,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:30,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:30,531 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:43:30,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:30,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:30,702 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:43:30,717 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:43:30,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:30,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:30,854 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:43:30,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:43:31,386 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 18 treesize of output 14 [2018-11-28 22:43:31,446 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 14 treesize of output 11 [2018-11-28 22:43:31,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:31,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:31,681 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:43:31,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-11-28 22:43:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:31,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:31,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-28 22:43:31,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 22:43:31,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 22:43:31,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:43:31,940 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 19 states. [2018-11-28 22:43:32,797 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-11-28 22:43:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:33,556 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-28 22:43:33,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:43:33,557 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-11-28 22:43:33,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:33,559 INFO L225 Difference]: With dead ends: 86 [2018-11-28 22:43:33,559 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 22:43:33,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-11-28 22:43:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 22:43:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-11-28 22:43:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 22:43:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-11-28 22:43:33,569 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 24 [2018-11-28 22:43:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:33,569 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-11-28 22:43:33,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 22:43:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-11-28 22:43:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:43:33,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:33,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:33,571 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:33,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:33,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2009352802, now seen corresponding path program 1 times [2018-11-28 22:43:33,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:33,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:33,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:33,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:33,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:43:33,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:43:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:43:33,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:33,671 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 10 states. [2018-11-28 22:43:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:33,966 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-28 22:43:33,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 22:43:33,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-28 22:43:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:33,969 INFO L225 Difference]: With dead ends: 69 [2018-11-28 22:43:33,969 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 22:43:33,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:43:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 22:43:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-28 22:43:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 22:43:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-28 22:43:33,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2018-11-28 22:43:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:33,974 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-28 22:43:33,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:43:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-28 22:43:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:43:33,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:33,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:33,976 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:33,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:33,976 INFO L82 PathProgramCache]: Analyzing trace with hash -689762273, now seen corresponding path program 1 times [2018-11-28 22:43:33,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:33,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:34,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:34,473 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:43:34,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:34,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:34,540 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:43:34,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 22:43:34,582 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:43:34,584 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:43:34,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,597 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:43:34,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-11-28 22:43:34,650 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:43:34,655 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:43:34,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,680 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:43:34,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-11-28 22:43:37,943 WARN L180 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 22:43:38,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-11-28 22:43:38,165 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 45 treesize of output 38 [2018-11-28 22:43:38,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:38,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-28 22:43:38,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:38,465 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 34 treesize of output 26 [2018-11-28 22:43:38,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:38,686 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 29 treesize of output 27 [2018-11-28 22:43:38,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:38,787 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 26 treesize of output 24 [2018-11-28 22:43:38,788 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:38,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-11-28 22:43:38,895 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-28 22:43:39,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-11-28 22:43:39,078 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-28 22:43:39,273 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 34 treesize of output 26 [2018-11-28 22:43:39,273 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:39,278 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 35 treesize of output 27 [2018-11-28 22:43:39,279 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:39,287 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 31 treesize of output 23 [2018-11-28 22:43:39,287 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:39,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-28 22:43:39,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 22:43:39,474 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-11-28 22:43:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:39,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:39,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2018-11-28 22:43:39,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 22:43:39,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 22:43:39,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-11-28 22:43:39,614 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 28 states. [2018-11-28 22:43:40,600 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-11-28 22:43:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:41,922 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-28 22:43:41,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 22:43:41,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-11-28 22:43:41,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:41,925 INFO L225 Difference]: With dead ends: 109 [2018-11-28 22:43:41,925 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 22:43:41,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 22:43:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 22:43:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-11-28 22:43:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 22:43:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-11-28 22:43:41,931 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 27 [2018-11-28 22:43:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:41,932 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-11-28 22:43:41,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 22:43:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-11-28 22:43:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:43:41,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:41,933 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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:43:41,933 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:41,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1181155673, now seen corresponding path program 2 times [2018-11-28 22:43:41,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:41,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:41,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:41,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:41,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:42,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:42,320 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:43:42,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:43:42,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:43:42,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:43:42,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:42,407 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:43:42,423 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:43:42,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:42,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:42,450 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:43:42,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 22:43:42,493 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:43:42,496 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:43:42,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:42,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:42,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:42,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 22:43:42,670 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:43:42,680 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:43:42,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:42,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:42,701 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:43:42,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-11-28 22:43:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:42,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:42,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 22:43:42,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 22:43:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 22:43:42,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-11-28 22:43:42,863 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 21 states. [2018-11-28 22:43:43,390 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-11-28 22:43:44,186 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-11-28 22:43:44,958 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-11-28 22:43:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:45,105 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-11-28 22:43:45,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:43:45,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 22:43:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:45,107 INFO L225 Difference]: With dead ends: 92 [2018-11-28 22:43:45,108 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 22:43:45,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 22:43:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 22:43:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-11-28 22:43:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:43:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-28 22:43:45,112 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 30 [2018-11-28 22:43:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:45,112 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-28 22:43:45,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 22:43:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-28 22:43:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 22:43:45,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:45,114 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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:43:45,114 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:45,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash 19179001, now seen corresponding path program 2 times [2018-11-28 22:43:45,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:45,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:45,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:43:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:45,537 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-11-28 22:43:45,920 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-28 22:43:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:46,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:46,092 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:43:46,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:43:46,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:43:46,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:43:46,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:46,308 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 22:43:46,324 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:43:46,361 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:43:46,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,404 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:43:46,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,415 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-11-28 22:43:46,441 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:43:46,444 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:43:46,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-28 22:43:46,501 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:43:46,504 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:43:46,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:46,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-28 22:43:47,452 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 46 treesize of output 40 [2018-11-28 22:43:47,461 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:43:47,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:47,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-28 22:43:47,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:47,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:47,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 22:43:47,514 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-11-28 22:43:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:47,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:47,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 26 [2018-11-28 22:43:47,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 22:43:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 22:43:47,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-11-28 22:43:47,777 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 27 states. [2018-11-28 22:43:48,712 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2018-11-28 22:43:48,889 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2018-11-28 22:43:49,047 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2018-11-28 22:43:49,741 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-11-28 22:43:50,027 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-11-28 22:43:50,337 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-11-28 22:43:50,561 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-11-28 22:43:50,721 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2018-11-28 22:43:50,904 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-11-28 22:43:51,460 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-11-28 22:43:51,869 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2018-11-28 22:43:52,055 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-11-28 22:43:52,196 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2018-11-28 22:43:52,683 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-28 22:43:52,860 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2018-11-28 22:43:53,212 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2018-11-28 22:43:53,609 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2018-11-28 22:43:54,185 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-11-28 22:43:54,469 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-11-28 22:43:54,643 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2018-11-28 22:43:54,827 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2018-11-28 22:43:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:54,989 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-28 22:43:54,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 22:43:54,991 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-11-28 22:43:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:54,992 INFO L225 Difference]: With dead ends: 105 [2018-11-28 22:43:54,993 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 22:43:54,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=778, Invalid=4052, Unknown=0, NotChecked=0, Total=4830 [2018-11-28 22:43:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 22:43:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 60. [2018-11-28 22:43:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 22:43:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-28 22:43:54,998 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 40 [2018-11-28 22:43:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:54,998 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-28 22:43:54,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 22:43:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-28 22:43:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 22:43:55,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:55,000 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:55,001 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:43:55,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:55,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1792606315, now seen corresponding path program 1 times [2018-11-28 22:43:55,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:55,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:55,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:43:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 22:43:55,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:55,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:43:55,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:55,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:55,504 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:43:55,508 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:43:55,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,536 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:43:55,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,545 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-28 22:43:55,575 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 15 treesize of output 12 [2018-11-28 22:43:55,578 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 12 treesize of output 11 [2018-11-28 22:43:55,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 22:43:55,615 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 28 treesize of output 29 [2018-11-28 22:43:55,619 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:43:55,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:43:55,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 22:43:56,716 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 22:44:01,141 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 22:44:01,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-11-28 22:44:01,248 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 48 treesize of output 46 [2018-11-28 22:44:01,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:01,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-28 22:44:01,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,721 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 33 treesize of output 26 [2018-11-28 22:44:01,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,725 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 38 treesize of output 31 [2018-11-28 22:44:01,726 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,792 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 26 treesize of output 16 [2018-11-28 22:44:01,793 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,796 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 31 treesize of output 21 [2018-11-28 22:44:01,796 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,859 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 40 treesize of output 30 [2018-11-28 22:44:01,860 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-28 22:44:01,944 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-28 22:44:02,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-28 22:44:02,068 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-28 22:44:02,200 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 32 treesize of output 30 [2018-11-28 22:44:02,201 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:02,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-28 22:44:02,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 22:44:02,387 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-11-28 22:44:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:44:02,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:02,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-11-28 22:44:02,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 22:44:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 22:44:02,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 22:44:02,571 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 33 states. [2018-11-28 22:44:03,035 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 22:44:03,677 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-28 22:44:05,003 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-28 22:44:07,234 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-28 22:44:13,977 WARN L180 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-28 22:44:15,504 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-11-28 22:44:16,503 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-28 22:44:20,154 WARN L180 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-28 22:44:21,547 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-11-28 22:44:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:21,560 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-11-28 22:44:21,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 22:44:21,562 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-11-28 22:44:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:21,563 INFO L225 Difference]: With dead ends: 84 [2018-11-28 22:44:21,563 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:44:21,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2018-11-28 22:44:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:44:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:44:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:44:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:44:21,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2018-11-28 22:44:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:21,566 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:44:21,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 22:44:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:44:21,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:44:21,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:44:21 BoogieIcfgContainer [2018-11-28 22:44:21,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:44:21,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:44:21,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:44:21,573 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:44:21,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:26" (3/4) ... [2018-11-28 22:44:21,576 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:44:21,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:44:21,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-11-28 22:44:21,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:44:21,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:44:21,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:44:21,591 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 22:44:21,591 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 22:44:21,591 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 22:44:21,642 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:44:21,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:44:21,644 INFO L168 Benchmark]: Toolchain (without parser) took 57216.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.7 MB). Free memory was 951.4 MB in the beginning and 925.2 MB in the end (delta: 26.2 MB). Peak memory consumption was 418.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:21,645 INFO L168 Benchmark]: CDTParser took 0.41 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:21,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:21,645 INFO L168 Benchmark]: Boogie Preprocessor took 75.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:21,647 INFO L168 Benchmark]: RCFGBuilder took 886.37 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: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:21,648 INFO L168 Benchmark]: TraceAbstraction took 55460.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.5 MB). Free memory was 1.1 GB in the beginning and 925.2 MB in the end (delta: 138.9 MB). Peak memory consumption was 408.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:21,648 INFO L168 Benchmark]: Witness Printer took 70.03 ms. Allocated memory is still 1.4 GB. Free memory is still 925.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:21,653 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.41 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 716.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 886.37 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: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55460.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.5 MB). Free memory was 1.1 GB in the beginning and 925.2 MB in the end (delta: 138.9 MB). Peak memory consumption was 408.4 MB. Max. memory is 11.5 GB. * Witness Printer took 70.03 ms. Allocated memory is still 1.4 GB. Free memory is still 925.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: 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: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 15 error locations. SAFE Result, 55.3s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 34.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 1703 SDslu, 1956 SDs, 0 SdLazy, 3220 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2702 ImplicationChecksByTransitivity, 42.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=14, 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, 17 MinimizatonAttempts, 177 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 535 ConstructedInterpolants, 106 QuantifiedInterpolants, 316055 SizeOfPredicates, 74 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 74/173 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...