./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 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_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-91b1670 [2018-11-28 22:44:20,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:44:20,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:44:20,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:44:20,994 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:44:20,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:44:21,000 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:44:21,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:44:21,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:44:21,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:44:21,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:44:21,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:44:21,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:44:21,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:44:21,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:44:21,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:44:21,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:44:21,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:44:21,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:44:21,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:44:21,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:44:21,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:44:21,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:44:21,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:44:21,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:44:21,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:44:21,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:44:21,050 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:44:21,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:44:21,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:44:21,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:44:21,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:44:21,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:44:21,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:44:21,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:44:21,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:44:21,059 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:44:21,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:44:21,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:44:21,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:44:21,083 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:44:21,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:44:21,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:44:21,085 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:44:21,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:44:21,086 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:44:21,086 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:44:21,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:44:21,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:44:21,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:44:21,086 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:44:21,087 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:44:21,088 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:44:21,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:44:21,088 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:44:21,088 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:44:21,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:44:21,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:44:21,089 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:44:21,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:44:21,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:44:21,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:44:21,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:44:21,090 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:44:21,091 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:44:21,091 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 [2018-11-28 22:44:21,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:44:21,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:44:21,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:44:21,166 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:44:21,167 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:44:21,168 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:21,233 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545299b80/f9b00dbf0e0543959fd96a1a8b734d06/FLAGbcee15fb2 [2018-11-28 22:44:21,817 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:44:21,818 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:21,837 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545299b80/f9b00dbf0e0543959fd96a1a8b734d06/FLAGbcee15fb2 [2018-11-28 22:44:22,045 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545299b80/f9b00dbf0e0543959fd96a1a8b734d06 [2018-11-28 22:44:22,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:44:22,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:44:22,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:44:22,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:44:22,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:44:22,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d80e72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22, skipping insertion in model container [2018-11-28 22:44:22,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:44:22,136 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:44:22,564 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:44:22,584 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:44:22,631 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:44:22,775 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:44:22,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22 WrapperNode [2018-11-28 22:44:22,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:44:22,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:44:22,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:44:22,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:44:22,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (1/1) ... [2018-11-28 22:44:22,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:44:22,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:44:22,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:44:22,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:44:22,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:44:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:44:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:44:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:44:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:44:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-11-28 22:44:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:44:22,906 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:44:22,906 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:44:22,906 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:44:22,906 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:44:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:44:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:44:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:44:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:44:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:44:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:44:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:44:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:44:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:44:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:44:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:44:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:44:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:44:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:44:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:44:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:44:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:44:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:44:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:44:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:44:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:44:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:44:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:44:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:44:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:44:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:44:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:44:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:44:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:44:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:44:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:44:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:44:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:44:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:44:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:44:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:44:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:44:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:44:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:44:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:44:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:44:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:44:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:44:22,924 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:44:22,924 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:44:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:44:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:44:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:44:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:44:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:44:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:44:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:44:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:44:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:44:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:44:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:44:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:44:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:44:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:44:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:44:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:44:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:44:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:44:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:44:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:44:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:44:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:44:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:44:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:44:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:44:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:44:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:44:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:44:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:44:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:44:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:44:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:44:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:44:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:44:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:44:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:44:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:44:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:44:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:44:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:44:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:44:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:44:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:44:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:44:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:44:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:44:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2018-11-28 22:44:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:44:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:44:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:44:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:44:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:44:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:44:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:44:23,600 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:44:23,600 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 22:44:23,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:23 BoogieIcfgContainer [2018-11-28 22:44:23,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:44:23,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:44:23,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:44:23,606 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:44:23,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:44:22" (1/3) ... [2018-11-28 22:44:23,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75829730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:44:23, skipping insertion in model container [2018-11-28 22:44:23,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:22" (2/3) ... [2018-11-28 22:44:23,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75829730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:44:23, skipping insertion in model container [2018-11-28 22:44:23,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:23" (3/3) ... [2018-11-28 22:44:23,611 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:23,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:44:23,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-28 22:44:23,649 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-28 22:44:23,677 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:44:23,678 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:44:23,678 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:44:23,678 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:44:23,679 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:44:23,679 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:44:23,679 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:44:23,679 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:44:23,679 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:44:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-28 22:44:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:44:23,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:23,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:23,711 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:23,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:23,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1015483689, now seen corresponding path program 1 times [2018-11-28 22:44:23,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:23,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:23,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:23,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:23,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:23,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:23,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:23,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:23,925 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-11-28 22:44:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:24,023 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-28 22:44:24,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:24,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:44:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:24,034 INFO L225 Difference]: With dead ends: 37 [2018-11-28 22:44:24,035 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 22:44:24,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 22:44:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-28 22:44:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 22:44:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-28 22:44:24,075 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2018-11-28 22:44:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:24,075 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-28 22:44:24,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-28 22:44:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:44:24,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:24,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:24,077 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:24,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1015483690, now seen corresponding path program 1 times [2018-11-28 22:44:24,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:24,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:24,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:24,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:24,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:24,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:24,181 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-11-28 22:44:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:24,281 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-28 22:44:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:24,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:44:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:24,285 INFO L225 Difference]: With dead ends: 33 [2018-11-28 22:44:24,285 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 22:44:24,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 22:44:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 22:44:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 22:44:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-28 22:44:24,292 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-11-28 22:44:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:24,293 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-28 22:44:24,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-28 22:44:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:44:24,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:24,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:24,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:24,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:24,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1415223278, now seen corresponding path program 1 times [2018-11-28 22:44:24,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:24,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:24,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:24,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:24,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:24,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:24,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:24,368 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-11-28 22:44:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:24,457 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-28 22:44:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:24,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 22:44:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:24,459 INFO L225 Difference]: With dead ends: 32 [2018-11-28 22:44:24,459 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 22:44:24,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 22:44:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-28 22:44:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 22:44:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-28 22:44:24,465 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 11 [2018-11-28 22:44:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:24,466 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-28 22:44:24,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-28 22:44:24,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:44:24,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:24,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:24,467 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:24,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:24,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1415223279, now seen corresponding path program 1 times [2018-11-28 22:44:24,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:24,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:24,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:24,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:24,695 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-28 22:44:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:24,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:24,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:24,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:24,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:24,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:24,697 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2018-11-28 22:44:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:24,729 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 22:44:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:24,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 22:44:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:24,731 INFO L225 Difference]: With dead ends: 31 [2018-11-28 22:44:24,731 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 22:44:24,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 22:44:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-28 22:44:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 22:44:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-28 22:44:24,736 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-11-28 22:44:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:24,737 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-28 22:44:24,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-28 22:44:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:44:24,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:24,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:24,738 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:24,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash -195009075, now seen corresponding path program 1 times [2018-11-28 22:44:24,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:24,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:24,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:24,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:24,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:24,854 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-11-28 22:44:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:25,114 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-28 22:44:25,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:25,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 22:44:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:25,116 INFO L225 Difference]: With dead ends: 30 [2018-11-28 22:44:25,116 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 22:44:25,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 22:44:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 22:44:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 22:44:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-28 22:44:25,121 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2018-11-28 22:44:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:25,122 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-28 22:44:25,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-28 22:44:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:44:25,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:25,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:25,123 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:25,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:25,123 INFO L82 PathProgramCache]: Analyzing trace with hash -195009074, now seen corresponding path program 1 times [2018-11-28 22:44:25,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:25,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:25,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:25,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:25,384 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-28 22:44:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:25,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:25,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:44:25,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:44:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:44:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:25,458 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2018-11-28 22:44:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:25,675 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-28 22:44:25,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:25,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 22:44:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:25,677 INFO L225 Difference]: With dead ends: 33 [2018-11-28 22:44:25,677 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 22:44:25,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 22:44:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-28 22:44:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 22:44:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-28 22:44:25,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2018-11-28 22:44:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:25,683 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-28 22:44:25,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:44:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-28 22:44:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:25,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:25,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:25,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:25,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1575404250, now seen corresponding path program 1 times [2018-11-28 22:44:25,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:25,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:25,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:25,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:25,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:25,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:25,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:25,841 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 7 states. [2018-11-28 22:44:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:26,016 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-28 22:44:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:26,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-28 22:44:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:26,018 INFO L225 Difference]: With dead ends: 32 [2018-11-28 22:44:26,019 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 22:44:26,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 22:44:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-28 22:44:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 22:44:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-28 22:44:26,023 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2018-11-28 22:44:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:26,024 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-28 22:44:26,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-28 22:44:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:26,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:26,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:26,025 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:26,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1575404251, now seen corresponding path program 1 times [2018-11-28 22:44:26,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:26,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:26,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:26,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:26,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:44:26,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:44:26,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:44:26,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:26,231 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-11-28 22:44:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:26,431 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-28 22:44:26,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:44:26,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-28 22:44:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:26,433 INFO L225 Difference]: With dead ends: 35 [2018-11-28 22:44:26,433 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 22:44:26,433 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 [2018-11-28 22:44:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 22:44:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-28 22:44:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 22:44:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-28 22:44:26,438 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 18 [2018-11-28 22:44:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:26,438 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-28 22:44:26,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:44:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-28 22:44:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:26,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:26,439 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:26,440 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:26,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash -489606055, now seen corresponding path program 1 times [2018-11-28 22:44:26,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:26,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:26,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:26,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:26,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:26,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 22:44:26,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:44:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:44:26,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:26,813 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2018-11-28 22:44:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:27,149 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-28 22:44:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:44:27,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-28 22:44:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:27,152 INFO L225 Difference]: With dead ends: 58 [2018-11-28 22:44:27,152 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 22:44:27,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:44:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 22:44:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-11-28 22:44:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:44:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-28 22:44:27,170 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2018-11-28 22:44:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:27,173 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-28 22:44:27,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:44:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-28 22:44:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:27,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:27,174 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:27,174 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:27,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash -489603877, now seen corresponding path program 1 times [2018-11-28 22:44:27,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:27,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:27,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:27,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:27,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 22:44:27,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:44:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:44:27,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:27,450 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 11 states. [2018-11-28 22:44:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:27,658 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-28 22:44:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:44:27,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-28 22:44:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:27,664 INFO L225 Difference]: With dead ends: 85 [2018-11-28 22:44:27,664 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 22:44:27,665 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 [2018-11-28 22:44:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 22:44:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-11-28 22:44:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 22:44:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-11-28 22:44:27,672 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 23 [2018-11-28 22:44:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:27,672 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-28 22:44:27,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:44:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-28 22:44:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:27,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:27,674 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:27,674 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:27,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1510672231, now seen corresponding path program 1 times [2018-11-28 22:44:27,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:27,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:27,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:28,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:28,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:28,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:28,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:28,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 22:44:28,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-28 22:44:28,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:28,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:28,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:28,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:44:28,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 22:44:28,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 22:44:28,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:28,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:28,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:28,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-11-28 22:44:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:28,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:28,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-11-28 22:44:28,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:44:28,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:44:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:44:28,920 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 20 states. [2018-11-28 22:44:29,663 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-11-28 22:44:29,858 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-11-28 22:44:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:30,609 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-11-28 22:44:30,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:44:30,610 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-11-28 22:44:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:30,612 INFO L225 Difference]: With dead ends: 91 [2018-11-28 22:44:30,612 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 22:44:30,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2018-11-28 22:44:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 22:44:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-11-28 22:44:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 22:44:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-11-28 22:44:30,632 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 23 [2018-11-28 22:44:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:30,632 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-11-28 22:44:30,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:44:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-28 22:44:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:30,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:30,638 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:30,640 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:30,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1195944985, now seen corresponding path program 1 times [2018-11-28 22:44:30,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:30,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:30,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:30,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:31,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:31,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:31,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:31,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:31,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:31,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:31,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:31,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 22:44:31,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 22:44:31,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-28 22:44:31,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:31,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:31,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:31,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-11-28 22:44:31,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-28 22:44:31,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-28 22:44:31,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:31,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:31,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:31,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-11-28 22:44:32,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-28 22:44:32,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 22:44:32,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:32,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-28 22:44:32,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:32,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:32,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:32,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-11-28 22:44:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:32,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:32,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 26 [2018-11-28 22:44:32,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 22:44:32,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 22:44:32,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-11-28 22:44:32,475 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 27 states. [2018-11-28 22:44:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:34,063 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-11-28 22:44:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:44:34,064 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-11-28 22:44:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:34,066 INFO L225 Difference]: With dead ends: 97 [2018-11-28 22:44:34,066 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 22:44:34,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 22:44:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 22:44:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2018-11-28 22:44:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 22:44:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-11-28 22:44:34,080 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 23 [2018-11-28 22:44:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:34,080 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2018-11-28 22:44:34,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 22:44:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2018-11-28 22:44:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:44:34,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:34,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:34,083 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:34,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1885053830, now seen corresponding path program 1 times [2018-11-28 22:44:34,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:34,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:34,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:34,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:34,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:34,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:34,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:34,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:34,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:34,196 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 4 states. [2018-11-28 22:44:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:34,247 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2018-11-28 22:44:34,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:34,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-28 22:44:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:34,249 INFO L225 Difference]: With dead ends: 91 [2018-11-28 22:44:34,249 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 22:44:34,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 22:44:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 22:44:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 22:44:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-28 22:44:34,257 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 25 [2018-11-28 22:44:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:34,258 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-28 22:44:34,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-28 22:44:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:44:34,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:34,259 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] [2018-11-28 22:44:34,259 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:34,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash 680848861, now seen corresponding path program 2 times [2018-11-28 22:44:34,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:34,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:34,510 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-11-28 22:44:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:34,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:34,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:35,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:35,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:35,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:35,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:35,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:35,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:35,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:35,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 22:44:35,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 22:44:35,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 22:44:35,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:35,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:35,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:35,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-11-28 22:44:35,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-28 22:44:35,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 22:44:35,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:35,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-11-28 22:44:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:35,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:35,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-28 22:44:35,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 22:44:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 22:44:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:44:35,831 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 24 states. [2018-11-28 22:44:36,808 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-11-28 22:44:37,278 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2018-11-28 22:44:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:37,345 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-11-28 22:44:37,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 22:44:37,346 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-11-28 22:44:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:37,347 INFO L225 Difference]: With dead ends: 79 [2018-11-28 22:44:37,347 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 22:44:37,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 22:44:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 22:44:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2018-11-28 22:44:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 22:44:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-28 22:44:37,352 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2018-11-28 22:44:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:37,358 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-28 22:44:37,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 22:44:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-28 22:44:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 22:44:37,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:37,359 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:37,364 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:37,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:37,364 INFO L82 PathProgramCache]: Analyzing trace with hash -199229532, now seen corresponding path program 2 times [2018-11-28 22:44:37,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:37,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:37,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:37,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:44:37,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:37,681 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-11-28 22:44:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:38,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:38,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:38,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:38,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:38,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:38,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:38,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:38,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:38,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:38,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:38,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:38,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:38,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:38,233 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-11-28 22:44:38,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 22:44:38,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 22:44:38,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:38,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:38,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:38,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-28 22:44:38,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 22:44:38,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 22:44:38,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:38,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:38,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:38,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-28 22:44:39,250 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 [2018-11-28 22:44:39,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 22:44:39,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:39,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-28 22:44:39,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:39,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:39,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 22:44:39,358 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:69 [2018-11-28 22:44:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:39,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:39,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 33 [2018-11-28 22:44:39,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-28 22:44:39,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 22:44:39,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 22:44:39,910 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 34 states. [2018-11-28 22:44:41,726 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-11-28 22:44:42,292 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2018-11-28 22:44:42,644 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2018-11-28 22:44:43,207 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2018-11-28 22:44:43,388 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-11-28 22:44:43,562 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2018-11-28 22:44:43,740 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2018-11-28 22:44:44,019 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2018-11-28 22:44:44,188 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-11-28 22:44:44,505 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2018-11-28 22:44:44,757 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2018-11-28 22:44:45,081 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 64 [2018-11-28 22:44:45,421 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-11-28 22:44:45,797 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2018-11-28 22:44:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:45,812 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-28 22:44:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 22:44:45,813 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 31 [2018-11-28 22:44:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:45,814 INFO L225 Difference]: With dead ends: 57 [2018-11-28 22:44:45,814 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:44:45,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=481, Invalid=3679, Unknown=0, NotChecked=0, Total=4160 [2018-11-28 22:44:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:44:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:44:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:44:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:44:45,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-28 22:44:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:45,817 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:44:45,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-28 22:44:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:44:45,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:44:45,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:44:45 BoogieIcfgContainer [2018-11-28 22:44:45,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:44:45,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:44:45,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:44:45,824 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:44:45,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:23" (3/4) ... [2018-11-28 22:44:45,831 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:44:45,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:44:45,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:44:45,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:44:45,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:44:45,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2018-11-28 22:44:45,842 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 22:44:45,842 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 22:44:45,843 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:44:45,893 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:44:45,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:44:45,894 INFO L168 Benchmark]: Toolchain (without parser) took 23843.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 954.0 MB in the beginning and 942.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 354.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:45,896 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:45,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:45,897 INFO L168 Benchmark]: Boogie Preprocessor took 66.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:45,897 INFO L168 Benchmark]: RCFGBuilder took 755.91 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.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:45,897 INFO L168 Benchmark]: TraceAbstraction took 22221.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.6 MB). Free memory was 1.1 GB in the beginning and 942.5 MB in the end (delta: 127.8 MB). Peak memory consumption was 335.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:45,901 INFO L168 Benchmark]: Witness Printer took 68.94 ms. Allocated memory is still 1.4 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:45,904 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 723.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 755.91 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.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22221.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.6 MB). Free memory was 1.1 GB in the beginning and 942.5 MB in the end (delta: 127.8 MB). Peak memory consumption was 335.4 MB. Max. memory is 11.5 GB. * Witness Printer took 68.94 ms. Allocated memory is still 1.4 GB. Free memory is still 942.5 MB. 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: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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, 22.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 366 SDtfs, 798 SDslu, 1820 SDs, 0 SdLazy, 1956 SolverSat, 229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 14.4s 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, 15 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 370 ConstructedInterpolants, 45 QuantifiedInterpolants, 106460 SizeOfPredicates, 67 NumberOfNonLiveVariables, 607 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 9/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...