./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrspn-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 bae2699bcd2830a9f6fd8179c1786410249a39fb .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:13:54,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:13:54,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:13:54,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:13:54,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:13:54,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:13:54,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:13:54,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:13:54,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:13:54,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:13:54,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:13:54,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:13:54,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:13:54,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:13:54,330 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:13:54,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:13:54,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:13:54,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:13:54,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:13:54,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:13:54,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:13:54,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:13:54,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:13:54,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:13:54,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:13:54,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:13:54,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:13:54,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:13:54,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:13:54,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:13:54,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:13:54,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:13:54,359 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:13:54,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:13:54,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:13:54,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:13:54,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:13:54,391 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:13:54,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:13:54,396 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:13:54,397 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:13:54,397 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:13:54,397 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:13:54,398 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:13:54,398 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:13:54,398 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:13:54,398 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:13:54,398 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:13:54,398 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:13:54,399 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:13:54,399 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:13:54,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:13:54,399 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:13:54,399 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:13:54,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:13:54,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:13:54,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:13:54,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:13:54,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:54,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:13:54,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:13:54,403 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:13:54,403 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:13:54,403 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 -> bae2699bcd2830a9f6fd8179c1786410249a39fb [2019-01-01 17:13:54,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:13:54,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:13:54,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:13:54,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:13:54,470 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:13:54,471 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:54,530 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3ec1abc/4541f9f9e18147608f40841c0b6bd8b5/FLAGfc406a711 [2019-01-01 17:13:55,044 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:13:55,045 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:55,058 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3ec1abc/4541f9f9e18147608f40841c0b6bd8b5/FLAGfc406a711 [2019-01-01 17:13:55,329 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3ec1abc/4541f9f9e18147608f40841c0b6bd8b5 [2019-01-01 17:13:55,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:13:55,335 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:13:55,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:55,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:13:55,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:13:55,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:55" (1/1) ... [2019-01-01 17:13:55,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28de41a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:55, skipping insertion in model container [2019-01-01 17:13:55,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:55" (1/1) ... [2019-01-01 17:13:55,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:13:55,403 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:13:55,794 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:55,816 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:13:55,879 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:56,009 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:13:56,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56 WrapperNode [2019-01-01 17:13:56,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:56,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:13:56,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:13:56,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:13:56,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (1/1) ... [2019-01-01 17:13:56,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (1/1) ... [2019-01-01 17:13:56,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (1/1) ... [2019-01-01 17:13:56,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (1/1) ... [2019-01-01 17:13:56,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (1/1) ... [2019-01-01 17:13:56,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (1/1) ... [2019-01-01 17:13:56,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (1/1) ... [2019-01-01 17:13:56,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:13:56,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:13:56,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:13:56,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:13:56,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:13:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:13:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:13:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:13:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2019-01-01 17:13:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:13:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:13:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:13:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:13:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:13:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:13:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:13:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:13:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:13:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:13:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:13:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:13:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:13:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:13:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:13:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:13:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:13:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:13:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:13:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:13:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:13:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:13:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:13:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:13:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:13:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:13:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:13:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:13:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:13:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:13:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:13:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:13:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:13:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:13:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:13:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:13:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:13:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:13:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:13:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:13:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:13:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:13:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:13:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:13:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:13:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:13:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:13:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:13:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:13:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:13:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:13:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:13:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:13:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:13:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:13:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:13:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:13:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:13:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:13:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:13:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:13:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:13:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:13:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:13:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:13:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:13:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:13:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:13:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:13:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:13:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:13:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:13:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:13:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:13:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:13:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:13:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:13:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:13:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:13:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:13:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:13:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:13:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:13:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:13:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:13:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:13:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:13:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:13:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:13:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:13:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:13:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:13:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:13:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:13:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:13:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:13:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:13:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:13:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:13:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:13:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:13:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:13:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:13:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:13:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2019-01-01 17:13:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:13:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:13:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:13:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:13:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:13:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:13:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:13:56,833 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:13:56,833 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:13:56,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:56 BoogieIcfgContainer [2019-01-01 17:13:56,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:13:56,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:13:56,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:13:56,839 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:13:56,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:13:55" (1/3) ... [2019-01-01 17:13:56,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d85eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:56, skipping insertion in model container [2019-01-01 17:13:56,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:56" (2/3) ... [2019-01-01 17:13:56,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d85eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:56, skipping insertion in model container [2019-01-01 17:13:56,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:56" (3/3) ... [2019-01-01 17:13:56,842 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:56,852 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:13:56,861 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-01 17:13:56,880 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-01 17:13:56,911 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:13:56,912 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:13:56,912 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:13:56,912 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:13:56,912 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:13:56,912 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:13:56,913 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:13:56,913 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:13:56,913 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:13:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-01-01 17:13:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:56,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:56,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:56,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:56,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:56,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1015483689, now seen corresponding path program 1 times [2019-01-01 17:13:56,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:56,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:57,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:57,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:57,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:57,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:57,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:57,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:57,172 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-01-01 17:13:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:57,324 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-01 17:13:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:57,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:13:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:57,334 INFO L225 Difference]: With dead ends: 37 [2019-01-01 17:13:57,335 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 17:13:57,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 17:13:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-01 17:13:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 17:13:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-01-01 17:13:57,375 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2019-01-01 17:13:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:57,375 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-01-01 17:13:57,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-01-01 17:13:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:57,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:57,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:57,377 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1015483690, now seen corresponding path program 1 times [2019-01-01 17:13:57,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:57,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:57,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:57,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:57,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:57,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:57,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:57,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:57,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:57,538 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2019-01-01 17:13:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:57,615 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-01 17:13:57,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:57,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:57,617 INFO L225 Difference]: With dead ends: 33 [2019-01-01 17:13:57,617 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:13:57,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:13:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-01 17:13:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 17:13:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-01 17:13:57,629 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2019-01-01 17:13:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:57,629 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-01 17:13:57,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-01 17:13:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:57,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:57,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:57,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:57,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1415223278, now seen corresponding path program 1 times [2019-01-01 17:13:57,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:57,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:57,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:57,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:57,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:57,734 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2019-01-01 17:13:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:57,784 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-01 17:13:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:57,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 17:13:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:57,787 INFO L225 Difference]: With dead ends: 32 [2019-01-01 17:13:57,788 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:13:57,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:13:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-01 17:13:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:13:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-01 17:13:57,803 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 11 [2019-01-01 17:13:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:57,803 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-01 17:13:57,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-01 17:13:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:57,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:57,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:57,805 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:57,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1415223279, now seen corresponding path program 1 times [2019-01-01 17:13:57,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:57,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:57,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:57,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:57,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:57,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:57,923 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2019-01-01 17:13:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:57,952 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-01 17:13:57,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:57,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-01 17:13:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:57,954 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:13:57,954 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:13:57,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:13:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-01 17:13:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 17:13:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-01 17:13:57,959 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2019-01-01 17:13:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:57,960 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-01 17:13:57,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-01 17:13:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:57,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:57,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:57,961 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:57,962 INFO L82 PathProgramCache]: Analyzing trace with hash -195009075, now seen corresponding path program 1 times [2019-01-01 17:13:57,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:57,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:58,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:58,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:58,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:58,066 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2019-01-01 17:13:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:58,266 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-01 17:13:58,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:58,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-01 17:13:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:58,267 INFO L225 Difference]: With dead ends: 30 [2019-01-01 17:13:58,267 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 17:13:58,268 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-01 17:13:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 17:13:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-01 17:13:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 17:13:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-01 17:13:58,272 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2019-01-01 17:13:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:58,273 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-01 17:13:58,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-01 17:13:58,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:13:58,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:58,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:58,274 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:58,275 INFO L82 PathProgramCache]: Analyzing trace with hash -195009074, now seen corresponding path program 1 times [2019-01-01 17:13:58,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:58,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:58,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:58,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:58,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:58,573 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2019-01-01 17:13:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:58,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:58,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:58,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:58,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:58,686 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-01-01 17:13:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:58,925 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-01 17:13:58,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:58,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 17:13:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:58,927 INFO L225 Difference]: With dead ends: 33 [2019-01-01 17:13:58,927 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:13:58,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:13:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-01 17:13:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:13:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-01 17:13:58,933 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2019-01-01 17:13:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:58,933 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-01 17:13:58,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-01 17:13:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:58,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:58,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:58,934 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1575404250, now seen corresponding path program 1 times [2019-01-01 17:13:58,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:58,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:58,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:59,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:59,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:59,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:59,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:59,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:59,073 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 7 states. [2019-01-01 17:13:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:59,260 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-01 17:13:59,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:59,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-01 17:13:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:59,262 INFO L225 Difference]: With dead ends: 32 [2019-01-01 17:13:59,262 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:13:59,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:13:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-01 17:13:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 17:13:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-01 17:13:59,268 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2019-01-01 17:13:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:59,268 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-01 17:13:59,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-01 17:13:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:59,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:59,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:59,270 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1575404251, now seen corresponding path program 1 times [2019-01-01 17:13:59,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:59,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:59,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:59,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:59,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:59,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:13:59,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:13:59,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:13:59,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:13:59,498 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2019-01-01 17:13:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:59,673 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-01 17:13:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:59,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-01-01 17:13:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:59,677 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:13:59,677 INFO L226 Difference]: Without dead ends: 35 [2019-01-01 17:13:59,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:13:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-01 17:13:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-01 17:13:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 17:13:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-01 17:13:59,681 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 18 [2019-01-01 17:13:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:59,682 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-01 17:13:59,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:13:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-01 17:13:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:13:59,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:59,683 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:59,683 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash -489606055, now seen corresponding path program 1 times [2019-01-01 17:13:59,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:59,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:59,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:13:59,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:13:59,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:13:59,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:59,922 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2019-01-01 17:14:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:00,225 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-01-01 17:14:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:14:00,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-01 17:14:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:00,226 INFO L225 Difference]: With dead ends: 58 [2019-01-01 17:14:00,227 INFO L226 Difference]: Without dead ends: 58 [2019-01-01 17:14:00,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:14:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-01 17:14:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2019-01-01 17:14:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 17:14:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-01-01 17:14:00,247 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-01-01 17:14:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:00,248 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-01-01 17:14:00,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:14:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-01-01 17:14:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:14:00,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:00,249 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:00,249 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:14:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash -489603877, now seen corresponding path program 1 times [2019-01-01 17:14:00,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:00,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:00,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:00,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:00,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:00,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:00,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:14:00,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:14:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:14:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:14:00,492 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 11 states. [2019-01-01 17:14:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:00,714 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-01-01 17:14:00,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 17:14:00,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-01 17:14:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:00,721 INFO L225 Difference]: With dead ends: 85 [2019-01-01 17:14:00,721 INFO L226 Difference]: Without dead ends: 85 [2019-01-01 17:14:00,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-01-01 17:14:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-01 17:14:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2019-01-01 17:14:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 17:14:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-01-01 17:14:00,729 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 23 [2019-01-01 17:14:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:00,730 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-01-01 17:14:00,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:14:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-01-01 17:14:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:14:00,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:00,731 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:00,731 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:14:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1510672231, now seen corresponding path program 1 times [2019-01-01 17:14:00,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:00,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:00,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:01,022 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-01 17:14:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:01,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:01,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:14:01,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:01,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:01,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:14:01,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:14:01,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:01,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:01,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:01,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 17:14:02,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-01 17:14:02,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:14:02,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:02,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:02,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:02,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-01 17:14:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:02,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:02,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-01-01 17:14:02,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:14:02,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:14:02,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:14:02,357 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 20 states. [2019-01-01 17:14:03,908 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-01-01 17:14:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:05,350 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2019-01-01 17:14:05,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:14:05,351 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-01-01 17:14:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:05,352 INFO L225 Difference]: With dead ends: 91 [2019-01-01 17:14:05,352 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 17:14:05,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=155, Invalid=774, Unknown=1, NotChecked=0, Total=930 [2019-01-01 17:14:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 17:14:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2019-01-01 17:14:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 17:14:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-01-01 17:14:05,362 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 23 [2019-01-01 17:14:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:05,363 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-01-01 17:14:05,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:14:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-01-01 17:14:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:14:05,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:05,364 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:05,364 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:14:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1195944985, now seen corresponding path program 1 times [2019-01-01 17:14:05,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:05,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:05,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:05,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:05,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:05,908 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-01 17:14:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:06,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:06,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:14:06,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:06,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:06,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:14:06,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:06,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:06,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-01 17:14:06,481 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-01 17:14:06,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:14:06,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:06,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:06,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:06,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-01 17:14:06,557 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-01 17:14:06,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:14:06,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:06,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:06,586 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-01 17:14:06,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-01 17:14:06,820 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-01 17:14:06,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:14:06,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:06,843 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-01 17:14:06,844 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:06,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:06,868 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-01 17:14:06,868 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-01 17:14:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2019-01-01 17:14:07,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 17:14:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 17:14:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:14:07,112 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 22 states. [2019-01-01 17:14:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:08,305 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2019-01-01 17:14:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:14:08,307 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-01-01 17:14:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:08,308 INFO L225 Difference]: With dead ends: 97 [2019-01-01 17:14:08,309 INFO L226 Difference]: Without dead ends: 97 [2019-01-01 17:14:08,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 17:14:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-01 17:14:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2019-01-01 17:14:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 17:14:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2019-01-01 17:14:08,319 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 23 [2019-01-01 17:14:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:08,319 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2019-01-01 17:14:08,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 17:14:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2019-01-01 17:14:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:14:08,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:08,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:08,321 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:14:08,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:08,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1885053830, now seen corresponding path program 1 times [2019-01-01 17:14:08,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:08,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:08,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:08,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:08,661 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-01-01 17:14:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:08,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:08,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:14:08,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:14:08,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:14:08,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:14:08,668 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 4 states. [2019-01-01 17:14:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:08,957 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2019-01-01 17:14:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:14:08,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-01-01 17:14:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:08,959 INFO L225 Difference]: With dead ends: 91 [2019-01-01 17:14:08,959 INFO L226 Difference]: Without dead ends: 68 [2019-01-01 17:14:08,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:14:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-01 17:14:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-01 17:14:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 17:14:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-01-01 17:14:08,967 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 25 [2019-01-01 17:14:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:08,967 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-01-01 17:14:08,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:14:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-01-01 17:14:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:14:08,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:08,970 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:08,970 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:14:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash 680848861, now seen corresponding path program 2 times [2019-01-01 17:14:08,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:08,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:08,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:08,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:08,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:09,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:09,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:14:09,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:14:09,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:14:09,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:14:09,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:09,617 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-01 17:14:09,810 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-01 17:14:09,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:09,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:09,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:09,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-01 17:14:09,874 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-01 17:14:09,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-01 17:14:09,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:09,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:09,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:09,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-01 17:14:10,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-01 17:14:10,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-01 17:14:10,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:10,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:10,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:10,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-01 17:14:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:10,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:10,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-01-01 17:14:10,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 17:14:10,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 17:14:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:14:10,353 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 24 states. [2019-01-01 17:14:11,325 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-01-01 17:14:11,540 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-01-01 17:14:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:12,042 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2019-01-01 17:14:12,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 17:14:12,043 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-01-01 17:14:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:12,044 INFO L225 Difference]: With dead ends: 79 [2019-01-01 17:14:12,044 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 17:14:12,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 17:14:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 17:14:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-01-01 17:14:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:14:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-01-01 17:14:12,051 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2019-01-01 17:14:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:12,051 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-01-01 17:14:12,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 17:14:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-01-01 17:14:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 17:14:12,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:12,052 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:12,055 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:14:12,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash -199229532, now seen corresponding path program 2 times [2019-01-01 17:14:12,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:12,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:12,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:12,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:14:12,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:12,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:12,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:14:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:14:12,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:14:12,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:14:12,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:12,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:14:12,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:12,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:12,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-01 17:14:12,801 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-01 17:14:12,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:14:12,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:12,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:12,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:12,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-01 17:14:12,864 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-01 17:14:12,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:14:12,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:12,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:12,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:12,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-01-01 17:14:13,229 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 17:14:14,990 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 59 treesize of output 49 [2019-01-01 17:14:14,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:14:15,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2019-01-01 17:14:15,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:15,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-01-01 17:14:15,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:15,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-01 17:14:15,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:15,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:15,108 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-01 17:14:15,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:81, output treesize:51 [2019-01-01 17:14:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:15,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:15,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 33 [2019-01-01 17:14:15,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-01 17:14:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-01 17:14:15,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 17:14:15,345 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 34 states. [2019-01-01 17:14:16,092 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-01 17:14:17,073 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-01-01 17:14:18,234 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-01-01 17:14:18,431 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-01-01 17:14:18,644 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-01-01 17:14:18,875 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-01-01 17:14:19,234 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-01 17:14:19,571 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-01 17:14:20,202 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-01-01 17:14:20,347 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-01 17:14:20,752 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-01-01 17:14:21,037 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-01-01 17:14:21,395 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-01-01 17:14:21,692 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-01-01 17:14:21,893 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-01-01 17:14:22,312 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 17:14:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:22,554 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-01-01 17:14:22,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-01 17:14:22,556 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 31 [2019-01-01 17:14:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:22,557 INFO L225 Difference]: With dead ends: 69 [2019-01-01 17:14:22,557 INFO L226 Difference]: Without dead ends: 69 [2019-01-01 17:14:22,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=402, Invalid=4019, Unknown=1, NotChecked=0, Total=4422 [2019-01-01 17:14:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-01 17:14:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2019-01-01 17:14:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 17:14:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-01-01 17:14:22,565 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 31 [2019-01-01 17:14:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:22,565 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-01-01 17:14:22,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-01 17:14:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-01-01 17:14:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 17:14:22,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:22,567 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:22,567 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:14:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash -176868231, now seen corresponding path program 1 times [2019-01-01 17:14:22,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:22,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:22,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:22,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:14:22,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:22,759 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 17:14:22,917 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 17:14:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 17:14:23,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:23,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:14:23,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:23,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:23,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:14:23,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:14:23,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:14:23,808 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-01 17:14:23,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 17:14:23,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:14:23,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-01 17:14:23,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-01 17:14:23,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-01 17:14:23,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:23,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:23,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-01 17:14:25,023 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 48 treesize of output 42 [2019-01-01 17:14:25,033 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 17 treesize of output 14 [2019-01-01 17:14:25,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:25,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-01 17:14:25,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:25,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:25,086 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-01 17:14:25,086 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-01-01 17:14:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 17:14:25,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:25,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2019-01-01 17:14:25,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-01 17:14:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-01 17:14:25,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 17:14:25,320 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 41 states. [2019-01-01 17:14:26,504 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-01-01 17:14:26,876 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-01-01 17:14:27,050 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-01-01 17:14:28,216 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-01-01 17:14:28,600 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-01-01 17:14:28,789 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-01-01 17:14:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:30,386 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-01-01 17:14:30,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-01 17:14:30,387 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-01-01 17:14:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:30,388 INFO L225 Difference]: With dead ends: 95 [2019-01-01 17:14:30,388 INFO L226 Difference]: Without dead ends: 95 [2019-01-01 17:14:30,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=974, Invalid=5668, Unknown=0, NotChecked=0, Total=6642 [2019-01-01 17:14:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-01 17:14:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2019-01-01 17:14:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 17:14:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2019-01-01 17:14:30,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 44 [2019-01-01 17:14:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:30,395 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2019-01-01 17:14:30,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-01 17:14:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2019-01-01 17:14:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 17:14:30,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:30,399 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:30,399 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-01-01 17:14:30,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 970591801, now seen corresponding path program 2 times [2019-01-01 17:14:30,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:30,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 17:14:30,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:30,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:14:30,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:14:30,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:14:30,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:14:30,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:30,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:14:30,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:14:30,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:14:30,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-01 17:14:30,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 17:14:30,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:14:30,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-01 17:14:30,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-01 17:14:30,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-01 17:14:30,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:30,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:30,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-01 17:14:31,119 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 33 treesize of output 31 [2019-01-01 17:14:31,129 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 17 treesize of output 14 [2019-01-01 17:14:31,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:31,141 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-01 17:14:31,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:31,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:31,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:31,162 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2019-01-01 17:14:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 17 proven. 39 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 17:14:31,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:31,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2019-01-01 17:14:31,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 17:14:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 17:14:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-01-01 17:14:31,370 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 27 states. [2019-01-01 17:14:34,330 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-01-01 17:14:36,826 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-01 17:14:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:36,853 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-01-01 17:14:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 17:14:36,855 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 49 [2019-01-01 17:14:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:36,855 INFO L225 Difference]: With dead ends: 79 [2019-01-01 17:14:36,856 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:14:36,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=370, Invalid=1792, Unknown=0, NotChecked=0, Total=2162 [2019-01-01 17:14:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:14:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:14:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:14:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:14:36,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-01-01 17:14:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:36,859 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:14:36,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 17:14:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:14:36,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:14:36,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:14:36 BoogieIcfgContainer [2019-01-01 17:14:36,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:14:36,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:14:36,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:14:36,867 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:14:36,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:56" (3/4) ... [2019-01-01 17:14:36,872 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:14:36,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:14:36,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:14:36,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:14:36,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:14:36,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2019-01-01 17:14:36,884 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-01 17:14:36,884 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 17:14:36,884 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:14:36,937 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:14:36,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:14:36,938 INFO L168 Benchmark]: Toolchain (without parser) took 41604.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 405.3 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -386.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:36,938 INFO L168 Benchmark]: CDTParser took 0.17 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-01 17:14:36,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:36,940 INFO L168 Benchmark]: Boogie Preprocessor took 62.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:36,941 INFO L168 Benchmark]: RCFGBuilder took 761.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:36,941 INFO L168 Benchmark]: TraceAbstraction took 40031.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -259.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:36,942 INFO L168 Benchmark]: Witness Printer took 70.17 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:36,946 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.17 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 674.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 761.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40031.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -259.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 70.17 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 9 error locations. SAFE Result, 39.9s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 404 SDtfs, 869 SDslu, 2315 SDs, 0 SdLazy, 3080 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3143 ImplicationChecksByTransitivity, 29.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 552 ConstructedInterpolants, 93 QuantifiedInterpolants, 276693 SizeOfPredicates, 115 NumberOfNonLiveVariables, 1103 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 81/274 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...