./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/subseq-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/subseq-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 1ed241b7ea3188deab01745f11227ce75decf7bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:36,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:44:36,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:44:36,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:44:36,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:44:36,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:44:36,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:44:36,159 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:44:36,161 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:44:36,162 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:44:36,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:44:36,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:44:36,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:44:36,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:44:36,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:44:36,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:44:36,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:44:36,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:44:36,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:44:36,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:44:36,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:44:36,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:44:36,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:44:36,198 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:44:36,198 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:44:36,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:44:36,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:44:36,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:44:36,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:44:36,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:44:36,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:44:36,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:44:36,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:44:36,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:44:36,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:44:36,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:44:36,214 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:36,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:44:36,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:44:36,235 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:44:36,235 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:44:36,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:44:36,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:44:36,236 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:44:36,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:44:36,236 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:44:36,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:44:36,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:44:36,238 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:44:36,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:44:36,238 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:44:36,238 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:44:36,238 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:44:36,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:44:36,239 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:44:36,239 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:44:36,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:44:36,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:44:36,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:44:36,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:44:36,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:44:36,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:44:36,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:44:36,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:44:36,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:44:36,242 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 -> 1ed241b7ea3188deab01745f11227ce75decf7bc [2018-11-28 22:44:36,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:44:36,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:44:36,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:44:36,300 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:44:36,301 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:44:36,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:36,370 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2389ab4c/d086502891054c3d9e54bcde3e238f47/FLAGab49358b5 [2018-11-28 22:44:36,902 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:44:36,903 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:36,918 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2389ab4c/d086502891054c3d9e54bcde3e238f47/FLAGab49358b5 [2018-11-28 22:44:37,211 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2389ab4c/d086502891054c3d9e54bcde3e238f47 [2018-11-28 22:44:37,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:44:37,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:44:37,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:44:37,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:44:37,223 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:44:37,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:44:37" (1/1) ... [2018-11-28 22:44:37,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fe42a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:37, skipping insertion in model container [2018-11-28 22:44:37,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:44:37" (1/1) ... [2018-11-28 22:44:37,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:44:37,302 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:44:37,699 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:44:37,715 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:44:37,787 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:44:37,843 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:44:37,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:37 WrapperNode [2018-11-28 22:44:37,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:44:37,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:44:37,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:44:37,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:44:37,938 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:37" (1/1) ... [2018-11-28 22:44:37,938 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:37" (1/1) ... [2018-11-28 22:44:37,956 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:37" (1/1) ... [2018-11-28 22:44:37,957 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:37" (1/1) ... [2018-11-28 22:44:37,986 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:37" (1/1) ... [2018-11-28 22:44:37,993 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:37" (1/1) ... [2018-11-28 22:44:37,997 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:37" (1/1) ... [2018-11-28 22:44:38,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:44:38,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:44:38,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:44:38,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:44:38,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:37" (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:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:44:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:44:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:44:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:44:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure subseq [2018-11-28 22:44:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:44:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:44:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:44:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:44:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:44:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:44:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:44:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:44:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:44:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:44:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:44:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:44:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:44:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:44:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:44:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:44:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:44:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:44:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:44:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:44:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:44:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:44:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:44:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:44:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:44:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:44:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:44:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:44:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:44:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:44:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:44:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:44:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:44:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:44:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:44:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:44:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:44:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:44:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:44:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:44:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:44:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:44:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:44:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:44:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:44:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:44:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:44:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:44:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:44:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:44:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:44:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:44:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:44:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:44:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:44:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:44:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:44:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:44:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:44:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:44:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:44:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:44:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:44:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:44:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:44:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:44:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:44:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:44:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:44:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:44:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:44:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:44:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:44:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:44:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:44:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:44:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:44:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:44:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:44:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:44:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:44:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:44:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:44:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:44:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:44:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:44:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:44:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:44:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:44:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:44:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:44:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:44:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:44:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:44:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:44:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:44:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:44:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:44:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:44:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:44:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:44:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:44:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:44:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:44:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure subseq [2018-11-28 22:44:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:44:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:44:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:44:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:44:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:44:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:44:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:44:38,784 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:44:38,785 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 22:44:38,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:38 BoogieIcfgContainer [2018-11-28 22:44:38,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:44:38,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:44:38,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:44:38,790 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:44:38,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:44:37" (1/3) ... [2018-11-28 22:44:38,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a21ce76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:44:38, skipping insertion in model container [2018-11-28 22:44:38,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:37" (2/3) ... [2018-11-28 22:44:38,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a21ce76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:44:38, skipping insertion in model container [2018-11-28 22:44:38,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:38" (3/3) ... [2018-11-28 22:44:38,793 INFO L112 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:44:38,802 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:44:38,810 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-11-28 22:44:38,827 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-11-28 22:44:38,860 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:44:38,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:44:38,861 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:44:38,861 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:44:38,863 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:44:38,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:44:38,863 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:44:38,863 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:44:38,863 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:44:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-28 22:44:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:44:38,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:38,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:38,895 INFO L423 AbstractCegarLoop]: === Iteration 1 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:38,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:38,902 INFO L82 PathProgramCache]: Analyzing trace with hash 364110360, now seen corresponding path program 1 times [2018-11-28 22:44:38,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:38,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:38,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:39,102 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:39,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:39,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:39,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:39,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:39,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:39,124 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-11-28 22:44:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:39,284 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 22:44:39,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:39,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:44:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:39,298 INFO L225 Difference]: With dead ends: 46 [2018-11-28 22:44:39,299 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:44:39,301 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:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:44:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:44:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:44:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-28 22:44:39,344 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2018-11-28 22:44:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:39,344 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-28 22:44:39,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-28 22:44:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:44:39,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:39,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:39,346 INFO L423 AbstractCegarLoop]: === Iteration 2 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:39,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash 364110361, now seen corresponding path program 1 times [2018-11-28 22:44:39,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:39,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:39,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:39,500 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:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:39,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:39,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:39,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:39,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:39,504 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-28 22:44:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:39,554 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-28 22:44:39,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:39,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:44:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:39,556 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:44:39,556 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:44:39,557 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:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:44:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 22:44:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:44:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-28 22:44:39,563 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-11-28 22:44:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:39,564 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-28 22:44:39,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-28 22:44:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:44:39,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:39,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:39,565 INFO L423 AbstractCegarLoop]: === Iteration 3 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:39,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480737, now seen corresponding path program 1 times [2018-11-28 22:44:39,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:39,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:39,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:39,653 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:39,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:39,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:39,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:39,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:39,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:39,655 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-11-28 22:44:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:39,808 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-28 22:44:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:39,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 22:44:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:39,810 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:44:39,810 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:44:39,810 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:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:44:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:44:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:44:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-28 22:44:39,823 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2018-11-28 22:44:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:39,824 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-28 22:44:39,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-28 22:44:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:44:39,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:39,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:39,825 INFO L423 AbstractCegarLoop]: === Iteration 4 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:39,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480736, now seen corresponding path program 1 times [2018-11-28 22:44:39,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:39,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:39,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:39,948 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:39,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:39,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:39,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:39,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:39,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:39,950 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-11-28 22:44:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:39,974 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-28 22:44:39,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:39,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 22:44:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:39,978 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:44:39,978 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:44:39,979 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:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:44:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:44:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-28 22:44:39,984 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2018-11-28 22:44:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:39,984 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 22:44:39,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-28 22:44:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:44:39,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:39,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:39,986 INFO L423 AbstractCegarLoop]: === Iteration 5 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:39,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:39,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1984019961, now seen corresponding path program 1 times [2018-11-28 22:44:39,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:39,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:39,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:39,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:40,062 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:40,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:40,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:44:40,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:40,064 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-11-28 22:44:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:40,437 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-28 22:44:40,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:44:40,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 22:44:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:40,439 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:44:40,439 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 22:44:40,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 22:44:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 22:44:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:44:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-28 22:44:40,451 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2018-11-28 22:44:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:40,452 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 22:44:40,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-28 22:44:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:44:40,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:40,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:40,458 INFO L423 AbstractCegarLoop]: === Iteration 6 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:40,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1984019962, now seen corresponding path program 1 times [2018-11-28 22:44:40,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:40,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:40,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:40,637 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:40,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:40,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:40,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:40,639 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2018-11-28 22:44:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:40,836 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-28 22:44:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:40,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-28 22:44:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:40,842 INFO L225 Difference]: With dead ends: 58 [2018-11-28 22:44:40,842 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 22:44:40,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 22:44:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-11-28 22:44:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 22:44:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-28 22:44:40,851 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 14 [2018-11-28 22:44:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:40,851 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-28 22:44:40,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-28 22:44:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:40,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:40,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:40,853 INFO L423 AbstractCegarLoop]: === Iteration 7 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:40,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1401263346, now seen corresponding path program 1 times [2018-11-28 22:44:40,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:40,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:40,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:40,930 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:40,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:40,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:44:40,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:40,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:40,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:40,934 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 5 states. [2018-11-28 22:44:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:41,040 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-28 22:44:41,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:44:41,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 22:44:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:41,042 INFO L225 Difference]: With dead ends: 45 [2018-11-28 22:44:41,042 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 22:44:41,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 22:44:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 22:44:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:44:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-28 22:44:41,052 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 17 [2018-11-28 22:44:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:41,053 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-28 22:44:41,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-11-28 22:44:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:41,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:41,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:41,056 INFO L423 AbstractCegarLoop]: === Iteration 8 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:41,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:41,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1401263345, now seen corresponding path program 1 times [2018-11-28 22:44:41,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:41,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:41,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:41,188 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:41,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:41,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:41,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:41,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:41,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:41,190 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 7 states. [2018-11-28 22:44:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:41,372 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-28 22:44:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:41,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-28 22:44:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:41,374 INFO L225 Difference]: With dead ends: 60 [2018-11-28 22:44:41,374 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 22:44:41,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 22:44:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-28 22:44:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 22:44:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-28 22:44:41,380 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-11-28 22:44:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:41,380 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-28 22:44:41,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-28 22:44:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:44:41,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:41,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:41,383 INFO L423 AbstractCegarLoop]: === Iteration 9 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:41,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash 262199082, now seen corresponding path program 1 times [2018-11-28 22:44:41,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:41,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:41,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:41,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:41,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:41,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:41,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:41,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:41,430 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 3 states. [2018-11-28 22:44:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:41,445 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-28 22:44:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:41,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 22:44:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:41,448 INFO L225 Difference]: With dead ends: 57 [2018-11-28 22:44:41,449 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 22:44:41,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 22:44:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-28 22:44:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 22:44:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-28 22:44:41,454 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2018-11-28 22:44:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:41,455 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-28 22:44:41,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-28 22:44:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:41,456 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:41,456 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] [2018-11-28 22:44:41,456 INFO L423 AbstractCegarLoop]: === Iteration 10 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:41,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:41,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1761616738, now seen corresponding path program 1 times [2018-11-28 22:44:41,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:41,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:41,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:41,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:41,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:41,668 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:41,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:41,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:41,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:41,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:41,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:41,670 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-11-28 22:44:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:41,790 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-11-28 22:44:41,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:41,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-28 22:44:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:41,793 INFO L225 Difference]: With dead ends: 55 [2018-11-28 22:44:41,793 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 22:44:41,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 22:44:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 22:44:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 22:44:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-28 22:44:41,798 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23 [2018-11-28 22:44:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:41,798 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-28 22:44:41,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-28 22:44:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:44:41,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:41,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:41,800 INFO L423 AbstractCegarLoop]: === Iteration 11 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:41,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:41,800 INFO L82 PathProgramCache]: Analyzing trace with hash -685750361, now seen corresponding path program 1 times [2018-11-28 22:44:41,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:41,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:41,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:41,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:42,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:42,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:44:42,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:44:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:44:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:42,018 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 9 states. [2018-11-28 22:44:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:42,199 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-28 22:44:42,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:44:42,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-28 22:44:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:42,201 INFO L225 Difference]: With dead ends: 57 [2018-11-28 22:44:42,201 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 22:44:42,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:44:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 22:44:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 22:44:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 22:44:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-28 22:44:42,208 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 24 [2018-11-28 22:44:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:42,209 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-28 22:44:42,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:44:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-28 22:44:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:44:42,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:42,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:42,210 INFO L423 AbstractCegarLoop]: === Iteration 12 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:42,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1615072229, now seen corresponding path program 1 times [2018-11-28 22:44:42,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:42,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:42,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:42,970 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2018-11-28 22:44:43,163 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-11-28 22:44:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:43,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:43,288 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:43,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:43,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:43,694 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 11 treesize of output 8 [2018-11-28 22:44:43,710 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 8 treesize of output 7 [2018-11-28 22:44:43,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:43,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:43,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:43,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 22:44:44,288 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 15 treesize of output 11 [2018-11-28 22:44:44,305 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 11 treesize of output 3 [2018-11-28 22:44:44,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:44,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:44,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:44,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-28 22:44:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:44,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:44:44,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2018-11-28 22:44:44,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:44:44,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:44:44,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:44:44,415 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 17 states. [2018-11-28 22:44:44,962 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-28 22:44:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:45,923 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-11-28 22:44:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 22:44:45,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-28 22:44:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:45,926 INFO L225 Difference]: With dead ends: 79 [2018-11-28 22:44:45,926 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 22:44:45,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 22:44:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 22:44:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-11-28 22:44:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 22:44:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2018-11-28 22:44:45,933 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2018-11-28 22:44:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:45,933 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2018-11-28 22:44:45,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:44:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2018-11-28 22:44:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:44:45,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:45,934 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:45,934 INFO L423 AbstractCegarLoop]: === Iteration 13 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:45,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:45,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1575452162, now seen corresponding path program 1 times [2018-11-28 22:44:45,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:45,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:45,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:45,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:45,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:46,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:46,288 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:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:46,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:46,332 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:46,334 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:46,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:46,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:46,348 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:46,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:44:46,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 22:44:46,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 22:44:46,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:46,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:46,594 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:46,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-11-28 22:44:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:46,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:46,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2018-11-28 22:44:46,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:44:46,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:44:46,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:44:46,863 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 20 states. [2018-11-28 22:44:48,991 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-11-28 22:44:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:49,492 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-11-28 22:44:49,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:44:49,493 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-28 22:44:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:49,494 INFO L225 Difference]: With dead ends: 84 [2018-11-28 22:44:49,495 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 22:44:49,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2018-11-28 22:44:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 22:44:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-11-28 22:44:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 22:44:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2018-11-28 22:44:49,501 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 27 [2018-11-28 22:44:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:49,501 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2018-11-28 22:44:49,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:44:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-11-28 22:44:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 22:44:49,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:49,503 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:49,503 INFO L423 AbstractCegarLoop]: === Iteration 14 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:49,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1862759084, now seen corresponding path program 1 times [2018-11-28 22:44:49,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:49,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:49,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:49,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:49,953 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-11-28 22:44:50,305 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:50,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:50,305 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:50,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:50,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:50,479 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 22:44:50,492 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:50,532 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:50,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,576 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:50,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,585 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-28 22:44:50,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 22:44:50,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:44:50,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 22:44:50,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-28 22:44:50,675 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:50,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:50,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:50,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 22:44:53,141 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 22:44:53,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-11-28 22:44:53,491 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-11-28 22:44:53,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 51 [2018-11-28 22:44:53,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-28 22:44:53,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-28 22:44:53,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-28 22:44:53,913 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 39 treesize of output 29 [2018-11-28 22:44:53,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:53,916 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 38 treesize of output 28 [2018-11-28 22:44:53,917 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:53,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-11-28 22:44:53,934 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:54,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-28 22:44:54,079 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:54,293 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 44 treesize of output 42 [2018-11-28 22:44:54,294 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:54,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2018-11-28 22:44:54,441 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:54,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 22:44:54,562 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:54,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-28 22:44:54,565 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:54,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-28 22:44:54,658 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:54,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-28 22:44:54,662 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:54,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-28 22:44:54,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 22:44:54,853 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-11-28 22:44:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:54,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:54,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 23 [2018-11-28 22:44:54,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 22:44:54,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 22:44:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:44:54,969 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 24 states. [2018-11-28 22:45:00,107 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-11-28 22:45:07,425 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-11-28 22:45:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:07,980 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-28 22:45:07,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 22:45:07,981 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-11-28 22:45:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:07,982 INFO L225 Difference]: With dead ends: 92 [2018-11-28 22:45:07,982 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 22:45:07,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=343, Invalid=1548, Unknown=1, NotChecked=0, Total=1892 [2018-11-28 22:45:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 22:45:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 46. [2018-11-28 22:45:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 22:45:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-28 22:45:07,988 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 34 [2018-11-28 22:45:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:07,988 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-28 22:45:07,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 22:45:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-28 22:45:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 22:45:07,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:07,989 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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:45:07,989 INFO L423 AbstractCegarLoop]: === Iteration 15 === [subseqErr9REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:45:07,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:07,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1816536437, now seen corresponding path program 2 times [2018-11-28 22:45:07,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:07,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:07,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:07,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:07,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:08,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:45:08,658 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:45:08,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:45:08,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:45:08,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:45:08,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:45:08,716 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:45:08,815 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:45:08,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:45:08,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:45:08,847 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:45:08,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 22:45:08,876 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:45:08,879 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:45:08,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:08,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:08,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:08,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 22:45:09,079 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:45:09,211 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:45:09,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:45:09,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:45:09,468 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:45:09,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-11-28 22:45:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:09,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:45:09,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-11-28 22:45:09,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 22:45:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 22:45:09,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:45:09,641 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 22 states. [2018-11-28 22:45:10,256 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-11-28 22:45:11,391 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-28 22:45:11,772 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-11-28 22:45:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:12,018 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-28 22:45:12,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 22:45:12,019 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-11-28 22:45:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:12,020 INFO L225 Difference]: With dead ends: 45 [2018-11-28 22:45:12,020 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:45:12,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 22:45:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:45:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:45:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:45:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:45:12,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-28 22:45:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:12,023 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:45:12,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 22:45:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:45:12,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:45:12,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:45:12 BoogieIcfgContainer [2018-11-28 22:45:12,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:45:12,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:45:12,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:45:12,035 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:45:12,035 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:38" (3/4) ... [2018-11-28 22:45:12,039 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:45:12,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:45:12,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure subseq [2018-11-28 22:45:12,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:45:12,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:45:12,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:45:12,054 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 22:45:12,054 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 22:45:12,054 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:45:12,117 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:45:12,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:45:12,118 INFO L168 Benchmark]: Toolchain (without parser) took 34902.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 952.7 MB in the beginning and 904.7 MB in the end (delta: 48.0 MB). Peak memory consumption was 350.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:12,120 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:45:12,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.56 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:12,121 INFO L168 Benchmark]: Boogie Preprocessor took 157.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:12,124 INFO L168 Benchmark]: RCFGBuilder took 781.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:12,124 INFO L168 Benchmark]: TraceAbstraction took 33248.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.1 GB in the beginning and 913.7 MB in the end (delta: 161.8 MB). Peak memory consumption was 331.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:12,125 INFO L168 Benchmark]: Witness Printer took 82.49 ms. Allocated memory is still 1.3 GB. Free memory was 913.7 MB in the beginning and 904.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:12,132 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 627.56 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 781.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33248.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.1 GB in the beginning and 913.7 MB in the end (delta: 161.8 MB). Peak memory consumption was 331.1 MB. Max. memory is 11.5 GB. * Witness Printer took 82.49 ms. Allocated memory is still 1.3 GB. Free memory was 913.7 MB in the beginning and 904.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 15 error locations. SAFE Result, 33.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 954 SDslu, 1440 SDs, 0 SdLazy, 1891 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=13, 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, 78 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 398 ConstructedInterpolants, 41 QuantifiedInterpolants, 120321 SizeOfPredicates, 41 NumberOfNonLiveVariables, 622 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 15/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...