./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-13 21:56:31,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:31,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:31,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:31,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:31,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:31,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:31,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:31,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:31,505 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:31,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:31,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:31,507 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:31,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:31,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:31,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:31,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:31,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:31,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:31,518 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:31,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:31,520 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:31,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:31,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:31,524 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:31,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:31,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:31,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:31,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:31,530 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:31,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:31,531 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:31,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:31,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:31,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:31,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:31,535 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:31,550 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:31,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:31,552 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:31,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:31,553 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:31,553 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:31,553 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:31,553 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:31,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:31,554 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:31,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:31,555 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:31,555 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:31,555 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:31,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:31,556 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:31,556 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:31,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:31,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:31,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:31,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:31,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:31,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:31,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:31,557 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:31,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:31,558 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-13 21:56:31,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:31,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:31,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:31,611 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:31,611 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:31,612 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-13 21:56:31,666 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1613c69f/336f272199fd4205ba3b165d70510781/FLAGc3aa88d75 [2019-01-13 21:56:32,111 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:32,112 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:32,134 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1613c69f/336f272199fd4205ba3b165d70510781/FLAGc3aa88d75 [2019-01-13 21:56:32,448 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1613c69f/336f272199fd4205ba3b165d70510781 [2019-01-13 21:56:32,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:32,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:32,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:32,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:32,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:32,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:32" (1/1) ... [2019-01-13 21:56:32,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee16498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:32, skipping insertion in model container [2019-01-13 21:56:32,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:32" (1/1) ... [2019-01-13 21:56:32,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:32,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:32,824 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:32,835 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:32,951 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:33,005 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:33,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33 WrapperNode [2019-01-13 21:56:33,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:33,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:33,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:33,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:33,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:33,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:33,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:33,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:33,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (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-13 21:56:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:33,131 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2019-01-13 21:56:33,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:33,136 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:33,141 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:33,143 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:33,143 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:33,143 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:33,143 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:33,143 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:33,143 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:33,143 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:33,143 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2019-01-13 21:56:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:33,783 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:33,784 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-13 21:56:33,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:33 BoogieIcfgContainer [2019-01-13 21:56:33,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:33,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:33,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:33,789 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:33,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:32" (1/3) ... [2019-01-13 21:56:33,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439acccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:33, skipping insertion in model container [2019-01-13 21:56:33,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33" (2/3) ... [2019-01-13 21:56:33,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439acccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:33, skipping insertion in model container [2019-01-13 21:56:33,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:33" (3/3) ... [2019-01-13 21:56:33,793 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:33,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:33,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 21:56:33,828 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 21:56:33,855 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:33,856 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:33,857 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:33,857 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:33,857 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:33,858 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:33,858 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:33,858 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:33,858 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-13 21:56:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:33,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:33,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:33,891 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1974220600, now seen corresponding path program 1 times [2019-01-13 21:56:33,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:33,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:33,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:33,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:33,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:34,087 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-13 21:56:34,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:34,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:34,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:34,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:34,108 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-01-13 21:56:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:34,230 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-13 21:56:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:34,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:34,244 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:34,244 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 21:56:34,246 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-13 21:56:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 21:56:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-13 21:56:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:56:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-01-13 21:56:34,289 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 10 [2019-01-13 21:56:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:34,290 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-01-13 21:56:34,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-01-13 21:56:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:34,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:34,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:34,292 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1974220599, now seen corresponding path program 1 times [2019-01-13 21:56:34,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:34,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:34,582 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-13 21:56:34,584 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-13 21:56:34,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:34,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:34,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:34,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:34,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:34,587 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-01-13 21:56:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:34,707 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-13 21:56:34,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:34,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:34,709 INFO L225 Difference]: With dead ends: 40 [2019-01-13 21:56:34,709 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 21:56:34,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 21:56:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 21:56:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-01-13 21:56:34,717 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 10 [2019-01-13 21:56:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:34,717 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-01-13 21:56:34,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-01-13 21:56:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:34,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:34,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:34,718 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:34,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1071296429, now seen corresponding path program 1 times [2019-01-13 21:56:34,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:34,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:34,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:34,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:34,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:34,789 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-13 21:56:34,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:34,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:34,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:34,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:34,791 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2019-01-13 21:56:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:34,962 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-13 21:56:34,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:34,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:56:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:34,964 INFO L225 Difference]: With dead ends: 39 [2019-01-13 21:56:34,964 INFO L226 Difference]: Without dead ends: 39 [2019-01-13 21:56:34,965 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-13 21:56:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-13 21:56:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-13 21:56:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 21:56:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-13 21:56:34,971 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2019-01-13 21:56:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:34,971 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-13 21:56:34,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-13 21:56:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:34,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:34,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:34,972 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1071296428, now seen corresponding path program 1 times [2019-01-13 21:56:34,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:34,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:34,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:34,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:34,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:35,103 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-13 21:56:35,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:35,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:35,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:35,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:35,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:35,105 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-01-13 21:56:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:35,172 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-01-13 21:56:35,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:35,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:56:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:35,174 INFO L225 Difference]: With dead ends: 38 [2019-01-13 21:56:35,174 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 21:56:35,175 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-13 21:56:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 21:56:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-13 21:56:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 21:56:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-01-13 21:56:35,181 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 11 [2019-01-13 21:56:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:35,182 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-01-13 21:56:35,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-01-13 21:56:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:56:35,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:35,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:35,183 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:35,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:35,185 INFO L82 PathProgramCache]: Analyzing trace with hash 910096825, now seen corresponding path program 1 times [2019-01-13 21:56:35,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:35,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:35,267 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-13 21:56:35,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:35,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:35,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:35,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:35,270 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2019-01-13 21:56:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:35,655 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-13 21:56:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:35,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 21:56:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:35,657 INFO L225 Difference]: With dead ends: 36 [2019-01-13 21:56:35,657 INFO L226 Difference]: Without dead ends: 36 [2019-01-13 21:56:35,658 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-13 21:56:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-13 21:56:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-13 21:56:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-01-13 21:56:35,662 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2019-01-13 21:56:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:35,663 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-13 21:56:35,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-01-13 21:56:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:56:35,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:35,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:35,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:35,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash 910096826, now seen corresponding path program 1 times [2019-01-13 21:56:35,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:35,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:35,829 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-13 21:56:35,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:35,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:35,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:35,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:35,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:35,832 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 7 states. [2019-01-13 21:56:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,021 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-01-13 21:56:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:36,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-13 21:56:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,026 INFO L225 Difference]: With dead ends: 50 [2019-01-13 21:56:36,026 INFO L226 Difference]: Without dead ends: 50 [2019-01-13 21:56:36,026 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-13 21:56:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-13 21:56:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2019-01-13 21:56:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:56:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-13 21:56:36,033 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2019-01-13 21:56:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,033 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-13 21:56:36,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-13 21:56:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:56:36,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:36,035 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1570280198, now seen corresponding path program 1 times [2019-01-13 21:56:36,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:36,150 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-13 21:56:36,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:36,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:36,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:36,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:36,152 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 6 states. [2019-01-13 21:56:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,295 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-13 21:56:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:36,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-13 21:56:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,298 INFO L225 Difference]: With dead ends: 40 [2019-01-13 21:56:36,298 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 21:56:36,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 21:56:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 21:56:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-13 21:56:36,304 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 16 [2019-01-13 21:56:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,304 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-13 21:56:36,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-13 21:56:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:56:36,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:36,305 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1570280197, now seen corresponding path program 1 times [2019-01-13 21:56:36,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:36,483 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-13 21:56:36,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:36,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:36,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:36,485 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2019-01-13 21:56:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,650 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-13 21:56:36,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:36,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-13 21:56:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,653 INFO L225 Difference]: With dead ends: 40 [2019-01-13 21:56:36,653 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 21:56:36,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 21:56:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 21:56:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-13 21:56:36,657 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 16 [2019-01-13 21:56:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,658 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-13 21:56:36,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-13 21:56:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:36,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,659 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-13 21:56:36,659 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1505749765, now seen corresponding path program 1 times [2019-01-13 21:56:36,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:36,758 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-13 21:56:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:36,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:36,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:36,760 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-13 21:56:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,875 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-13 21:56:36,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:36,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-13 21:56:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,877 INFO L225 Difference]: With dead ends: 39 [2019-01-13 21:56:36,877 INFO L226 Difference]: Without dead ends: 39 [2019-01-13 21:56:36,878 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-13 21:56:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-13 21:56:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-13 21:56:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 21:56:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-13 21:56:36,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-01-13 21:56:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,882 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-13 21:56:36,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-13 21:56:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:36,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,884 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-13 21:56:36,884 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1505749764, now seen corresponding path program 1 times [2019-01-13 21:56:36,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:37,184 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-13 21:56:37,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:37,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:37,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:37,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:37,188 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-01-13 21:56:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:37,305 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-01-13 21:56:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:37,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-13 21:56:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:37,309 INFO L225 Difference]: With dead ends: 48 [2019-01-13 21:56:37,310 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 21:56:37,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 21:56:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2019-01-13 21:56:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-13 21:56:37,315 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2019-01-13 21:56:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:37,315 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-13 21:56:37,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-13 21:56:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:37,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:37,316 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-13 21:56:37,316 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash 378404680, now seen corresponding path program 1 times [2019-01-13 21:56:37,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:37,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:37,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:37,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:37,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:37,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:37,482 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-13 21:56:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:37,565 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-13 21:56:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:37,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-13 21:56:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:37,569 INFO L225 Difference]: With dead ends: 39 [2019-01-13 21:56:37,569 INFO L226 Difference]: Without dead ends: 39 [2019-01-13 21:56:37,570 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-13 21:56:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-13 21:56:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-13 21:56:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 21:56:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-13 21:56:37,574 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2019-01-13 21:56:37,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:37,575 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-13 21:56:37,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-13 21:56:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:37,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:37,578 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-13 21:56:37,578 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash 378404681, now seen corresponding path program 1 times [2019-01-13 21:56:37,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:37,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:37,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:37,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:37,760 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-13 21:56:37,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:37,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:56:37,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:37,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:37,761 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2019-01-13 21:56:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:38,128 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-01-13 21:56:38,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:56:38,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-13 21:56:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:38,130 INFO L225 Difference]: With dead ends: 47 [2019-01-13 21:56:38,131 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 21:56:38,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-13 21:56:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 21:56:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-13 21:56:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:56:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-13 21:56:38,135 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2019-01-13 21:56:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:38,136 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-13 21:56:38,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-13 21:56:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:38,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:38,137 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-13 21:56:38,137 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash 378454410, now seen corresponding path program 1 times [2019-01-13 21:56:38,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:38,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:38,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:38,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:38,391 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-13 21:56:38,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:38,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 21:56:38,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 21:56:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 21:56:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:38,393 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2019-01-13 21:56:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:38,693 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-01-13 21:56:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 21:56:38,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-13 21:56:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:38,696 INFO L225 Difference]: With dead ends: 61 [2019-01-13 21:56:38,696 INFO L226 Difference]: Without dead ends: 61 [2019-01-13 21:56:38,697 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-13 21:56:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-13 21:56:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-01-13 21:56:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-13 21:56:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-01-13 21:56:38,702 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 20 [2019-01-13 21:56:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:38,702 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-01-13 21:56:38,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 21:56:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-01-13 21:56:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:38,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:38,704 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-13 21:56:38,704 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash -208351604, now seen corresponding path program 1 times [2019-01-13 21:56:38,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:38,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:38,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:39,019 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-13 21:56:39,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:39,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:56:39,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:56:39,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:56:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:39,021 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 9 states. [2019-01-13 21:56:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:39,287 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-01-13 21:56:39,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:56:39,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-13 21:56:39,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:39,289 INFO L225 Difference]: With dead ends: 100 [2019-01-13 21:56:39,289 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 21:56:39,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:56:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 21:56:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 59. [2019-01-13 21:56:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-13 21:56:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-01-13 21:56:39,295 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2019-01-13 21:56:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:39,295 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-01-13 21:56:39,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:56:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-01-13 21:56:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:39,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:39,297 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-13 21:56:39,297 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1219468854, now seen corresponding path program 1 times [2019-01-13 21:56:39,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:39,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:39,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:39,696 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-13 21:56:39,882 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-13 21:56:39,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:39,882 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-13 21:56:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:39,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:40,103 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-13 21:56:40,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:40,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:40,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:56:40,364 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-13 21:56:40,370 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-13 21:56:40,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:40,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:40,385 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-13 21:56:40,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:56:40,469 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-13 21:56:40,473 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-13 21:56:40,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:40,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:40,531 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-13 21:56:40,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:56:40,906 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-13 21:56:40,917 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-13 21:56:40,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:40,993 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-13 21:56:40,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:40,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:41,020 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-13 21:56:41,021 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-13 21:56:41,117 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-13 21:56:41,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:41,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-13 21:56:41,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 21:56:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 21:56:41,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:56:41,149 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 17 states. [2019-01-13 21:56:41,394 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-01-13 21:56:42,106 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-01-13 21:56:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:42,500 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2019-01-13 21:56:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:42,501 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-01-13 21:56:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:42,503 INFO L225 Difference]: With dead ends: 77 [2019-01-13 21:56:42,503 INFO L226 Difference]: Without dead ends: 77 [2019-01-13 21:56:42,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-01-13 21:56:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-13 21:56:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2019-01-13 21:56:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-13 21:56:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2019-01-13 21:56:42,508 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2019-01-13 21:56:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:42,509 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2019-01-13 21:56:42,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 21:56:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2019-01-13 21:56:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:56:42,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:42,510 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-13 21:56:42,510 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 616501515, now seen corresponding path program 1 times [2019-01-13 21:56:42,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:42,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:42,835 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-13 21:56:43,129 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-13 21:56:43,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:43,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 21:56:43,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:43,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:43,184 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-13 21:56:43,187 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-13 21:56:43,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:43,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:43,201 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-13 21:56:43,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:43,627 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-13 21:56:43,703 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-13 21:56:43,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:43,753 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-13 21:56:43,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:43,788 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-13 21:56:43,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:43,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:56:43,837 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-13 21:56:43,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2019-01-13 21:56:43,950 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-13 21:56:43,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:43,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-01-13 21:56:43,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:56:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:56:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:56:43,972 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 22 states. [2019-01-13 21:56:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:45,649 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-01-13 21:56:45,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:56:45,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-13 21:56:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:45,653 INFO L225 Difference]: With dead ends: 65 [2019-01-13 21:56:45,653 INFO L226 Difference]: Without dead ends: 65 [2019-01-13 21:56:45,654 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-13 21:56:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-13 21:56:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-13 21:56:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-13 21:56:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-01-13 21:56:45,659 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2019-01-13 21:56:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:45,660 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-01-13 21:56:45,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:56:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-01-13 21:56:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:45,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:45,667 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-13 21:56:45,668 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:45,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:45,668 INFO L82 PathProgramCache]: Analyzing trace with hash 246156161, now seen corresponding path program 1 times [2019-01-13 21:56:45,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:45,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:45,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:45,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:45,774 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-13 21:56:45,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:45,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:45,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:45,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:45,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:45,776 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2019-01-13 21:56:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:45,857 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-01-13 21:56:45,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:45,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-13 21:56:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:45,859 INFO L225 Difference]: With dead ends: 64 [2019-01-13 21:56:45,859 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 21:56:45,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 21:56:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-13 21:56:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 21:56:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-13 21:56:45,865 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 23 [2019-01-13 21:56:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:45,865 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-13 21:56:45,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-13 21:56:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:45,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:45,868 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-13 21:56:45,869 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:45,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash -247532276, now seen corresponding path program 1 times [2019-01-13 21:56:45,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:45,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:45,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:46,016 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-13 21:56:46,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:46,017 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-13 21:56:46,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:46,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:46,289 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-13 21:56:46,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:46,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2019-01-13 21:56:46,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:46,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:46,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:46,322 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 10 states. [2019-01-13 21:56:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:46,525 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-13 21:56:46,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:56:46,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-13 21:56:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:46,527 INFO L225 Difference]: With dead ends: 36 [2019-01-13 21:56:46,527 INFO L226 Difference]: Without dead ends: 36 [2019-01-13 21:56:46,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:56:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-13 21:56:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-01-13 21:56:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-13 21:56:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-13 21:56:46,531 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2019-01-13 21:56:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:46,531 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-13 21:56:46,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-13 21:56:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 21:56:46,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:46,532 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-13 21:56:46,532 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1655366823, now seen corresponding path program 1 times [2019-01-13 21:56:46,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:46,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:46,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:46,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:46,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:47,157 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-13 21:56:47,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:47,158 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-13 21:56:47,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:47,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:47,343 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-13 21:56:47,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:47,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2019-01-13 21:56:47,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 21:56:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 21:56:47,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:56:47,363 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 13 states. [2019-01-13 21:56:47,856 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 21:56:48,341 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-13 21:56:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:48,807 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-13 21:56:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:48,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-01-13 21:56:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:48,810 INFO L225 Difference]: With dead ends: 33 [2019-01-13 21:56:48,810 INFO L226 Difference]: Without dead ends: 30 [2019-01-13 21:56:48,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:56:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-13 21:56:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-13 21:56:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-13 21:56:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-13 21:56:48,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-01-13 21:56:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:48,812 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-13 21:56:48,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 21:56:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-13 21:56:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 21:56:48,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:48,813 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-13 21:56:48,814 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:48,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1655317094, now seen corresponding path program 2 times [2019-01-13 21:56:48,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:48,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:48,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:48,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:49,231 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-13 21:56:49,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:49,231 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-13 21:56:49,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:49,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:49,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:49,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:49,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, 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-13 21:56:49,305 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-13 21:56:49,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,324 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-13 21:56:49,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,333 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:56:49,391 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-13 21:56:49,401 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-13 21:56:49,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,425 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-13 21:56:49,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 21:56:49,461 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-13 21:56:49,463 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-13 21:56:49,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,481 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-13 21:56:49,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-13 21:56:49,795 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-13 21:56:49,805 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-13 21:56:49,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:49,819 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-13 21:56:49,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:49,848 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-13 21:56:49,848 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-01-13 21:56:49,948 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-13 21:56:49,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:49,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-01-13 21:56:49,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-13 21:56:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-13 21:56:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-01-13 21:56:49,970 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-01-13 21:56:51,591 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-13 21:56:52,024 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-01-13 21:56:52,333 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-01-13 21:56:52,581 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-13 21:56:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:52,930 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-13 21:56:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 21:56:52,931 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-01-13 21:56:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:52,932 INFO L225 Difference]: With dead ends: 30 [2019-01-13 21:56:52,932 INFO L226 Difference]: Without dead ends: 30 [2019-01-13 21:56:52,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 21:56:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-13 21:56:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-13 21:56:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-13 21:56:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-13 21:56:52,935 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-01-13 21:56:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:52,936 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-13 21:56:52,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-13 21:56:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-13 21:56:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:52,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:52,937 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-13 21:56:52,937 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1621829413, now seen corresponding path program 2 times [2019-01-13 21:56:52,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:52,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:52,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:52,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:56:52,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:53,183 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-13 21:56:53,624 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-13 21:56:53,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:53,625 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-13 21:56:53,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:53,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:53,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:53,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:53,705 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-13 21:56:53,722 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-13 21:56:53,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:53,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:53,747 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-13 21:56:53,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:22 [2019-01-13 21:56:53,787 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-13 21:56:53,790 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-13 21:56:53,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,797 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-13 21:56:53,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-13 21:56:54,355 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-13 21:56:54,359 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-13 21:56:54,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,384 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-13 21:56:54,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:54,428 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-13 21:56:54,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:54,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:56:54,476 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-13 21:56:54,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2019-01-13 21:56:54,538 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-13 21:56:54,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:54,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-01-13 21:56:54,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-13 21:56:54,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-13 21:56:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-01-13 21:56:54,559 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2019-01-13 21:56:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:55,933 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-13 21:56:55,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 21:56:55,934 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-01-13 21:56:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:55,935 INFO L225 Difference]: With dead ends: 29 [2019-01-13 21:56:55,935 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:56:55,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2019-01-13 21:56:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:56:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:56:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:56:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:56:55,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-01-13 21:56:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:55,938 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:56:55,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-13 21:56:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:56:55,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:56:55,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:56:55 BoogieIcfgContainer [2019-01-13 21:56:55,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:56:55,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:56:55,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:56:55,944 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:56:55,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:33" (3/4) ... [2019-01-13 21:56:55,948 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:56:55,953 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:56:55,954 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2019-01-13 21:56:55,954 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:56:55,954 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:56:55,954 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:56:55,959 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-13 21:56:55,959 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-13 21:56:55,959 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:56:56,006 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:56:56,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:56:56,007 INFO L168 Benchmark]: Toolchain (without parser) took 23555.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 250.6 MB). Free memory was 952.7 MB in the beginning and 970.8 MB in the end (delta: -18.1 MB). Peak memory consumption was 232.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,008 INFO L168 Benchmark]: CDTParser took 0.16 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-13 21:56:56,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 551.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -111.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,009 INFO L168 Benchmark]: Boogie Preprocessor took 66.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,010 INFO L168 Benchmark]: RCFGBuilder took 712.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,010 INFO L168 Benchmark]: TraceAbstraction took 22157.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.0 GB in the beginning and 980.1 MB in the end (delta: 29.1 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,011 INFO L168 Benchmark]: Witness Printer took 62.64 ms. Allocated memory is still 1.3 GB. Free memory was 980.1 MB in the beginning and 970.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,014 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 551.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -111.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 712.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22157.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.0 GB in the beginning and 980.1 MB in the end (delta: 29.1 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. * Witness Printer took 62.64 ms. Allocated memory is still 1.3 GB. Free memory was 980.1 MB in the beginning and 970.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 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: 543]: 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: 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: 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: 546]: 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 - PositiveResult [Line: 560]: 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 - 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.0s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 519 SDtfs, 812 SDslu, 1960 SDs, 0 SdLazy, 2213 SolverSat, 158 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 13.1s 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.1s 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...