./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-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 cbb495583d601bf9f19d9da57531415381b22d5a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:08:02,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:08:02,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:08:02,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:08:02,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:08:02,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:08:02,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:08:02,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:08:02,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:08:02,491 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:08:02,492 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:08:02,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:08:02,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:08:02,495 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:08:02,496 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:08:02,497 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:08:02,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:08:02,500 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:08:02,502 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:08:02,504 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:08:02,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:08:02,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:08:02,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:08:02,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:08:02,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:08:02,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:08:02,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:08:02,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:08:02,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:08:02,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:08:02,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:08:02,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:08:02,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:08:02,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:08:02,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:08:02,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:08:02,520 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:08:02,535 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:08:02,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:08:02,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:08:02,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:08:02,537 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:08:02,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:08:02,538 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:08:02,538 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:08:02,538 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:08:02,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:08:02,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:08:02,539 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:08:02,539 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:08:02,539 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:08:02,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:08:02,539 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:08:02,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:08:02,541 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:08:02,541 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:08:02,541 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:08:02,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:08:02,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:08:02,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:08:02,543 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:08:02,543 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:08:02,543 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 -> cbb495583d601bf9f19d9da57531415381b22d5a [2019-01-14 18:08:02,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:08:02,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:08:02,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:08:02,596 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:08:02,596 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:08:02,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:02,651 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1941add3/f15354b694fa4ef9a9ec3d9882009940/FLAGabd4b7b57 [2019-01-14 18:08:03,139 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:08:03,140 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:03,155 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1941add3/f15354b694fa4ef9a9ec3d9882009940/FLAGabd4b7b57 [2019-01-14 18:08:03,432 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1941add3/f15354b694fa4ef9a9ec3d9882009940 [2019-01-14 18:08:03,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:08:03,438 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:08:03,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:08:03,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:08:03,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:08:03,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:08:03" (1/1) ... [2019-01-14 18:08:03,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f9a908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:03, skipping insertion in model container [2019-01-14 18:08:03,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:08:03" (1/1) ... [2019-01-14 18:08:03,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:08:03,503 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:08:03,855 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:08:03,867 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:08:03,997 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:08:04,050 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:08:04,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04 WrapperNode [2019-01-14 18:08:04,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:08:04,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:08:04,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:08:04,052 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:08:04,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (1/1) ... [2019-01-14 18:08:04,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (1/1) ... [2019-01-14 18:08:04,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (1/1) ... [2019-01-14 18:08:04,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (1/1) ... [2019-01-14 18:08:04,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (1/1) ... [2019-01-14 18:08:04,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (1/1) ... [2019-01-14 18:08:04,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (1/1) ... [2019-01-14 18:08:04,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:08:04,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:08:04,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:08:04,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:08:04,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:08:04,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:08:04,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:08:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:08:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:08:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2019-01-14 18:08:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:08:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:08:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:08:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:08:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:08:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:08:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:08:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:08:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:08:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:08:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:08:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:08:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:08:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:08:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:08:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:08:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:08:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:08:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:08:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:08:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:08:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:08:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:08:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:08:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:08:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:08:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:08:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:08:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:08:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:08:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:08:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:08:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:08:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:08:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:08:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:08:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:08:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:08:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:08:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:08:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:08:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:08:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:08:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:08:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:08:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:08:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:08:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:08:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:08:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:08:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:08:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:08:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:08:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:08:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:08:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:08:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:08:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:08:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:08:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:08:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:08:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:08:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:08:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:08:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:08:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:08:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:08:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:08:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:08:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:08:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:08:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:08:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:08:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:08:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:08:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:08:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:08:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:08:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:08:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:08:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:08:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:08:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:08:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:08:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:08:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:08:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:08:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:08:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:08:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:08:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:08:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:08:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:08:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:08:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:08:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:08:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:08:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:08:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:08:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:08:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:08:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:08:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:08:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:08:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2019-01-14 18:08:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:08:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:08:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:08:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:08:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:08:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:08:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:08:04,803 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:08:04,803 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 18:08:04,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:04 BoogieIcfgContainer [2019-01-14 18:08:04,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:08:04,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:08:04,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:08:04,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:08:04,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:08:03" (1/3) ... [2019-01-14 18:08:04,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b17118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:08:04, skipping insertion in model container [2019-01-14 18:08:04,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:04" (2/3) ... [2019-01-14 18:08:04,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b17118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:08:04, skipping insertion in model container [2019-01-14 18:08:04,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:04" (3/3) ... [2019-01-14 18:08:04,813 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:04,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:08:04,831 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-14 18:08:04,848 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-14 18:08:04,875 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:08:04,875 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:08:04,876 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:08:04,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:08:04,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:08:04,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:08:04,876 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:08:04,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:08:04,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:08:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-14 18:08:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:08:04,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:04,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:04,910 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:04,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1974220600, now seen corresponding path program 1 times [2019-01-14 18:08:04,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:05,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:05,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:08:05,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:08:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:08:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:05,110 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-01-14 18:08:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:05,263 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-14 18:08:05,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:08:05,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:08:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:05,278 INFO L225 Difference]: With dead ends: 44 [2019-01-14 18:08:05,279 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:08:05,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:08:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-14 18:08:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 18:08:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-01-14 18:08:05,324 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 10 [2019-01-14 18:08:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:05,324 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-01-14 18:08:05,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:08:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-01-14 18:08:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:08:05,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:05,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:05,327 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1974220599, now seen corresponding path program 1 times [2019-01-14 18:08:05,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:05,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:05,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:05,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:05,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:05,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:05,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:05,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:05,508 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-01-14 18:08:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:05,582 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-14 18:08:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:05,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:08:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:05,584 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:08:05,584 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:08:05,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:08:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 18:08:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:08:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-01-14 18:08:05,592 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 10 [2019-01-14 18:08:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:05,592 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-01-14 18:08:05,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-01-14 18:08:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:08:05,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:05,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:05,594 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:05,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:05,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1071296429, now seen corresponding path program 1 times [2019-01-14 18:08:05,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:05,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:05,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:05,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:08:05,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:08:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:08:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:05,692 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2019-01-14 18:08:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:05,755 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-14 18:08:05,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:08:05,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 18:08:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:05,757 INFO L225 Difference]: With dead ends: 39 [2019-01-14 18:08:05,757 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:08:05,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:08:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-14 18:08:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:08:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-14 18:08:05,763 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2019-01-14 18:08:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:05,763 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-14 18:08:05,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:08:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-14 18:08:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:08:05,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:05,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:05,765 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:05,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1071296428, now seen corresponding path program 1 times [2019-01-14 18:08:05,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:05,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:05,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:05,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:05,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:05,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:05,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:05,869 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-01-14 18:08:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:05,929 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-01-14 18:08:05,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:05,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 18:08:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:05,931 INFO L225 Difference]: With dead ends: 38 [2019-01-14 18:08:05,931 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 18:08:05,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 18:08:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-14 18:08:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 18:08:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-01-14 18:08:05,937 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 11 [2019-01-14 18:08:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:05,937 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-01-14 18:08:05,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-01-14 18:08:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:08:05,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:05,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:05,939 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:05,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash 910096825, now seen corresponding path program 1 times [2019-01-14 18:08:05,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:05,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:06,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:06,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:08:06,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:08:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:08:06,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:08:06,020 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2019-01-14 18:08:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:06,414 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-14 18:08:06,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:08:06,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-14 18:08:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:06,415 INFO L225 Difference]: With dead ends: 36 [2019-01-14 18:08:06,415 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 18:08:06,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 18:08:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-14 18:08:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 18:08:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-01-14 18:08:06,421 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2019-01-14 18:08:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:06,422 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-14 18:08:06,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:08:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-01-14 18:08:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:08:06,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:06,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:06,423 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:06,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:06,423 INFO L82 PathProgramCache]: Analyzing trace with hash 910096826, now seen corresponding path program 1 times [2019-01-14 18:08:06,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:06,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:06,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:06,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:06,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:06,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:06,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:08:06,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:08:06,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:08:06,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:08:06,572 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 7 states. [2019-01-14 18:08:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:06,793 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-01-14 18:08:06,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:06,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-14 18:08:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:06,797 INFO L225 Difference]: With dead ends: 50 [2019-01-14 18:08:06,798 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 18:08:06,798 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 [2019-01-14 18:08:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 18:08:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2019-01-14 18:08:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 18:08:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-14 18:08:06,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2019-01-14 18:08:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:06,805 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-14 18:08:06,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:08:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-14 18:08:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:08:06,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:06,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:06,807 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:06,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1570280198, now seen corresponding path program 1 times [2019-01-14 18:08:06,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:06,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:06,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:06,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:08:06,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:08:06,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:08:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:06,888 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 6 states. [2019-01-14 18:08:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:07,055 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-14 18:08:07,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:07,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-14 18:08:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:07,056 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:08:07,056 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:08:07,057 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 [2019-01-14 18:08:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:08:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 18:08:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:08:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-14 18:08:07,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 16 [2019-01-14 18:08:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:07,062 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-14 18:08:07,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:08:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-14 18:08:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:08:07,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:07,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:07,063 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1570280197, now seen corresponding path program 1 times [2019-01-14 18:08:07,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:07,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:07,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:07,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:07,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:08:07,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:08:07,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:08:07,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:07,262 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2019-01-14 18:08:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:07,498 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-14 18:08:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:08:07,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-14 18:08:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:07,500 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:08:07,500 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:08:07,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:08:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:08:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 18:08:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:08:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-14 18:08:07,507 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 16 [2019-01-14 18:08:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:07,507 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 18:08:07,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:08:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-14 18:08:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:08:07,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:07,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:07,509 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:07,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1505749765, now seen corresponding path program 1 times [2019-01-14 18:08:07,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:07,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:07,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:07,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:07,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:07,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:08:07,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:08:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:08:07,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:07,595 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-14 18:08:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:07,711 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-14 18:08:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:07,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-14 18:08:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:07,713 INFO L225 Difference]: With dead ends: 39 [2019-01-14 18:08:07,713 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:08:07,714 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 [2019-01-14 18:08:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:08:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-14 18:08:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:08:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-14 18:08:07,718 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-01-14 18:08:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:07,718 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 18:08:07,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:08:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-14 18:08:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:08:07,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:07,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:07,720 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1505749764, now seen corresponding path program 1 times [2019-01-14 18:08:07,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:07,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:07,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:07,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:07,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:08:07,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:08:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:08:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:08:07,873 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-01-14 18:08:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:08,003 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-01-14 18:08:08,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:08:08,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-14 18:08:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:08,006 INFO L225 Difference]: With dead ends: 48 [2019-01-14 18:08:08,006 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 18:08:08,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:08:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 18:08:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2019-01-14 18:08:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:08:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-14 18:08:08,011 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2019-01-14 18:08:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:08,011 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 18:08:08,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:08:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-14 18:08:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:08:08,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:08,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:08,012 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash 378404680, now seen corresponding path program 1 times [2019-01-14 18:08:08,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:08,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:08,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:08,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:08,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:08,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:08,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:08:08,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:08:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:08:08,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:08,166 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-14 18:08:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:08,257 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-14 18:08:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:08,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 18:08:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:08,263 INFO L225 Difference]: With dead ends: 39 [2019-01-14 18:08:08,263 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:08:08,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:08:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-14 18:08:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:08:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-14 18:08:08,268 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2019-01-14 18:08:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:08,269 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 18:08:08,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:08:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-14 18:08:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:08:08,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:08,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:08,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash 378404681, now seen corresponding path program 1 times [2019-01-14 18:08:08,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:08,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:08,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:08,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:08,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:09,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:09,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:08:09,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:08:09,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:08:09,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:08:09,076 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2019-01-14 18:08:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:09,541 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-01-14 18:08:09,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:08:09,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-14 18:08:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:09,544 INFO L225 Difference]: With dead ends: 47 [2019-01-14 18:08:09,544 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 18:08:09,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:08:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 18:08:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-14 18:08:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 18:08:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-14 18:08:09,549 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2019-01-14 18:08:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:09,549 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-14 18:08:09,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:08:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-14 18:08:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:08:09,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:09,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:09,550 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash 378454410, now seen corresponding path program 1 times [2019-01-14 18:08:09,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:09,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:09,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:09,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:09,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 18:08:09,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 18:08:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 18:08:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:08:09,799 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2019-01-14 18:08:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:10,131 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-01-14 18:08:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:08:10,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-14 18:08:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:10,134 INFO L225 Difference]: With dead ends: 61 [2019-01-14 18:08:10,134 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 18:08:10,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:08:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 18:08:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-01-14 18:08:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 18:08:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-01-14 18:08:10,140 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 20 [2019-01-14 18:08:10,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:10,140 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-01-14 18:08:10,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 18:08:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-01-14 18:08:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:08:10,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:10,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:10,142 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:10,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:10,142 INFO L82 PathProgramCache]: Analyzing trace with hash -208351604, now seen corresponding path program 1 times [2019-01-14 18:08:10,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:10,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:10,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:10,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:10,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:10,695 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2019-01-14 18:08:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:10,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:10,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:08:10,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:08:10,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:08:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:08:10,874 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 9 states. [2019-01-14 18:08:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:11,192 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-01-14 18:08:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:08:11,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-14 18:08:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:11,194 INFO L225 Difference]: With dead ends: 100 [2019-01-14 18:08:11,194 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 18:08:11,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:08:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 18:08:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 59. [2019-01-14 18:08:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 18:08:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-01-14 18:08:11,199 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2019-01-14 18:08:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:11,200 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-01-14 18:08:11,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:08:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-01-14 18:08:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:08:11,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:11,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:11,201 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1219468854, now seen corresponding path program 1 times [2019-01-14 18:08:11,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:11,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:11,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:11,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:11,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:11,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:11,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:11,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:11,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:11,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:08:11,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:11,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:11,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-14 18:08:12,273 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 [2019-01-14 18:08:12,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:08:12,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:12,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:12,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:12,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-14 18:08:12,717 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 [2019-01-14 18:08:12,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:08:12,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:12,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:12,750 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. [2019-01-14 18:08:12,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-14 18:08:13,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-14 18:08:13,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-14 18:08:13,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:13,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:13,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:13,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:13,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:13,246 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-14 18:08:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:13,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:13,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-14 18:08:13,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:08:13,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:08:13,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:08:13,347 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 17 states. [2019-01-14 18:08:13,543 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-01-14 18:08:14,225 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-01-14 18:08:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:14,594 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2019-01-14 18:08:14,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:08:14,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-01-14 18:08:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:14,597 INFO L225 Difference]: With dead ends: 77 [2019-01-14 18:08:14,597 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 18:08:14,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-01-14 18:08:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 18:08:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2019-01-14 18:08:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 18:08:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2019-01-14 18:08:14,606 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2019-01-14 18:08:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:14,607 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2019-01-14 18:08:14,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:08:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2019-01-14 18:08:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:08:14,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:14,608 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:14,610 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 616501515, now seen corresponding path program 1 times [2019-01-14 18:08:14,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:14,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:14,950 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-14 18:08:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:15,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:15,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:15,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:15,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:15,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:08:15,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:08:15,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:15,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:15,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:15,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-14 18:08:15,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2019-01-14 18:08:15,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2019-01-14 18:08:15,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:15,767 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 27 treesize of output 25 [2019-01-14 18:08:15,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:15,806 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 19 treesize of output 14 [2019-01-14 18:08:15,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:15,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:08:15,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:15,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2019-01-14 18:08:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:15,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:15,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-01-14 18:08:15,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 18:08:15,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 18:08:15,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:08:15,992 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 22 states. [2019-01-14 18:08:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:17,691 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-01-14 18:08:17,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:08:17,692 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-14 18:08:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:17,694 INFO L225 Difference]: With dead ends: 65 [2019-01-14 18:08:17,694 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 18:08:17,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2019-01-14 18:08:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 18:08:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-14 18:08:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 18:08:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-01-14 18:08:17,703 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2019-01-14 18:08:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:17,704 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-01-14 18:08:17,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 18:08:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-01-14 18:08:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:08:17,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:17,707 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] [2019-01-14 18:08:17,707 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash 246156161, now seen corresponding path program 1 times [2019-01-14 18:08:17,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:17,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:17,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:18,022 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-01-14 18:08:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:18,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:18,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:18,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:18,027 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2019-01-14 18:08:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:18,486 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-01-14 18:08:18,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:18,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-14 18:08:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:18,488 INFO L225 Difference]: With dead ends: 64 [2019-01-14 18:08:18,488 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 18:08:18,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 18:08:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-14 18:08:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 18:08:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-14 18:08:18,491 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 23 [2019-01-14 18:08:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:18,492 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-14 18:08:18,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-14 18:08:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:08:18,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:18,493 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:18,493 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash -247532276, now seen corresponding path program 1 times [2019-01-14 18:08:18,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:18,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:18,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:18,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:18,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:18,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:18,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:18,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:18,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2019-01-14 18:08:18,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:08:18,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:08:18,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:08:18,992 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 10 states. [2019-01-14 18:08:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:19,127 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-14 18:08:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:08:19,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-14 18:08:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:19,129 INFO L225 Difference]: With dead ends: 36 [2019-01-14 18:08:19,129 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 18:08:19,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:08:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 18:08:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-01-14 18:08:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 18:08:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-14 18:08:19,132 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2019-01-14 18:08:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:19,133 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-14 18:08:19,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:08:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-14 18:08:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:08:19,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:19,134 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:19,134 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1655366823, now seen corresponding path program 1 times [2019-01-14 18:08:19,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:19,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:19,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:19,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:19,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:19,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:19,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:19,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 18:08:19,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2019-01-14 18:08:19,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 18:08:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 18:08:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:08:19,469 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 13 states. [2019-01-14 18:08:19,932 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 18:08:20,412 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-14 18:08:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:20,554 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-14 18:08:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:08:20,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-01-14 18:08:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:20,555 INFO L225 Difference]: With dead ends: 33 [2019-01-14 18:08:20,555 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 18:08:20,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:08:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 18:08:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 18:08:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 18:08:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-14 18:08:20,558 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-01-14 18:08:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:20,558 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-14 18:08:20,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 18:08:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-14 18:08:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:08:20,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:20,559 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] [2019-01-14 18:08:20,559 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1655317094, now seen corresponding path program 2 times [2019-01-14 18:08:20,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:20,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:20,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:20,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:20,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:20,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:20,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:08:21,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:08:21,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:08:21,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:21,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:08:21,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:08:21,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:08:21,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,089 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:08:21,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:21,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:08:21,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:21,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-14 18:08:21,217 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 [2019-01-14 18:08:21,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:08:21,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:21,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-14 18:08:21,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-01-14 18:08:21,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 18:08:21,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:21,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-14 18:08:21,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:21,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:21,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:21,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-01-14 18:08:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:21,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:21,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-01-14 18:08:21,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 18:08:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 18:08:21,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-01-14 18:08:21,718 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-01-14 18:08:23,409 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-14 18:08:23,867 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-01-14 18:08:24,205 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-01-14 18:08:24,467 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-14 18:08:24,618 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-01-14 18:08:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:24,829 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-14 18:08:24,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:08:24,830 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-01-14 18:08:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:24,831 INFO L225 Difference]: With dead ends: 30 [2019-01-14 18:08:24,831 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 18:08:24,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 18:08:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 18:08:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-14 18:08:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 18:08:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-14 18:08:24,834 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-01-14 18:08:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:24,836 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-14 18:08:24,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 18:08:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-14 18:08:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:08:24,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:24,839 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:24,839 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:24,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:24,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1621829413, now seen corresponding path program 2 times [2019-01-14 18:08:24,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:24,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:24,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:24,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:08:24,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:25,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:25,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:25,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:08:25,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:08:25,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:08:25,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:25,415 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 [2019-01-14 18:08:25,476 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 [2019-01-14 18:08:25,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:25,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:25,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:25,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:22 [2019-01-14 18:08:25,531 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 [2019-01-14 18:08:25,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:08:25,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:25,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:25,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:25,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-14 18:08:26,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2019-01-14 18:08:26,075 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 29 treesize of output 22 [2019-01-14 18:08:26,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:26,101 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 22 treesize of output 20 [2019-01-14 18:08:26,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:26,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2019-01-14 18:08:26,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:26,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:08:26,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:26,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2019-01-14 18:08:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:26,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:26,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-01-14 18:08:26,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 18:08:26,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 18:08:26,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-01-14 18:08:26,268 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2019-01-14 18:08:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:27,578 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-14 18:08:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 18:08:27,580 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-01-14 18:08:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:27,580 INFO L225 Difference]: With dead ends: 29 [2019-01-14 18:08:27,580 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:08:27,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 18:08:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:08:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:08:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:08:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:08:27,583 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-01-14 18:08:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:27,583 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:08:27,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 18:08:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:08:27,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:08:27,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:08:27 BoogieIcfgContainer [2019-01-14 18:08:27,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:08:27,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:08:27,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:08:27,590 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:08:27,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:04" (3/4) ... [2019-01-14 18:08:27,595 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:08:27,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:08:27,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2019-01-14 18:08:27,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:08:27,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:08:27,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:08:27,611 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-14 18:08:27,611 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 18:08:27,611 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 18:08:27,662 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:08:27,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:08:27,663 INFO L168 Benchmark]: Toolchain (without parser) took 24227.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 952.7 MB in the beginning and 958.3 MB in the end (delta: -5.6 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:27,664 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-14 18:08:27,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:27,665 INFO L168 Benchmark]: Boogie Preprocessor took 65.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:08:27,665 INFO L168 Benchmark]: RCFGBuilder took 686.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:27,665 INFO L168 Benchmark]: TraceAbstraction took 22783.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 967.3 MB in the end (delta: 90.4 MB). Peak memory consumption was 264.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:27,666 INFO L168 Benchmark]: Witness Printer took 72.33 ms. Allocated memory is still 1.3 GB. Free memory was 967.3 MB in the beginning and 958.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:27,669 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.15 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 610.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 686.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22783.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 967.3 MB in the end (delta: 90.4 MB). Peak memory consumption was 264.4 MB. Max. memory is 11.5 GB. * Witness Printer took 72.33 ms. Allocated memory is still 1.3 GB. Free memory was 967.3 MB in the beginning and 958.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 15 error locations. SAFE Result, 22.7s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 519 SDtfs, 812 SDslu, 1960 SDs, 0 SdLazy, 2213 SolverSat, 158 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 506 ConstructedInterpolants, 42 QuantifiedInterpolants, 98348 SizeOfPredicates, 58 NumberOfNonLiveVariables, 917 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 21/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...