./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/lis-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 13fe1afeee88065faace0f9ad16456f5e678cf43 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:12,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:12,107 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:12,119 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:12,119 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:12,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:12,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:12,123 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:12,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:12,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:12,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:12,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:12,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:12,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:12,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:12,131 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:12,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:12,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:12,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:12,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:12,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:12,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:12,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:12,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:12,144 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:12,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:12,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:12,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:12,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:12,149 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:12,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:12,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:12,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:12,150 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:12,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:12,152 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:12,153 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:12,176 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:12,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:12,178 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:12,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:12,179 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:12,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:12,179 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:12,179 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:12,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:12,179 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:12,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:12,181 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:12,181 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:12,181 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:12,181 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:12,182 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:12,182 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:12,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:12,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:12,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:12,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:12,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:12,185 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:12,186 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:12,186 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:12,186 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:12,187 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 -> 13fe1afeee88065faace0f9ad16456f5e678cf43 [2019-01-13 21:56:12,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:12,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:12,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:12,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:12,254 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:12,255 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:12,310 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e650c03c9/dd39714be5e8415f9810cecba508f1d4/FLAGf7ce614db [2019-01-13 21:56:12,810 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:12,813 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:12,826 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e650c03c9/dd39714be5e8415f9810cecba508f1d4/FLAGf7ce614db [2019-01-13 21:56:13,171 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e650c03c9/dd39714be5e8415f9810cecba508f1d4 [2019-01-13 21:56:13,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:13,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:13,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:13,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:13,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:13,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d419f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13, skipping insertion in model container [2019-01-13 21:56:13,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:13,231 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:13,590 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:13,607 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:13,755 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:13,807 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:13,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13 WrapperNode [2019-01-13 21:56:13,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:13,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:13,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:13,810 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:13,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (1/1) ... [2019-01-13 21:56:13,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:13,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:13,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:13,878 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:13,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:13,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:13,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:13,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:13,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:13,946 INFO L138 BoogieDeclarations]: Found implementation of procedure lis [2019-01-13 21:56:13,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:13,946 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:13,946 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:13,946 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:13,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:13,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:13,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:13,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:13,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:13,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:13,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:13,950 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:13,951 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:13,951 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:13,951 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:13,951 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:13,951 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:13,951 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:13,954 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:13,956 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:13,956 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:13,956 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:13,956 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:13,956 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:13,957 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:13,957 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:13,957 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:13,957 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:13,959 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure lis [2019-01-13 21:56:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:14,785 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:14,785 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-13 21:56:14,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:14 BoogieIcfgContainer [2019-01-13 21:56:14,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:14,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:14,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:14,792 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:14,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:13" (1/3) ... [2019-01-13 21:56:14,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4189e3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:14, skipping insertion in model container [2019-01-13 21:56:14,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:13" (2/3) ... [2019-01-13 21:56:14,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4189e3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:14, skipping insertion in model container [2019-01-13 21:56:14,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:14" (3/3) ... [2019-01-13 21:56:14,800 INFO L112 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:14,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:14,823 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-01-13 21:56:14,844 INFO L257 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-01-13 21:56:14,875 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:14,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:14,876 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:14,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:14,877 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:14,877 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:14,877 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:14,878 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:14,878 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-01-13 21:56:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 21:56:14,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:14,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:14,927 INFO L423 AbstractCegarLoop]: === Iteration 1 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:14,935 INFO L82 PathProgramCache]: Analyzing trace with hash 881745875, now seen corresponding path program 1 times [2019-01-13 21:56:14,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:14,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:14,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:15,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:15,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:15,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:15,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:15,217 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2019-01-13 21:56:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:15,545 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-01-13 21:56:15,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:15,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-13 21:56:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:15,557 INFO L225 Difference]: With dead ends: 62 [2019-01-13 21:56:15,557 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 21:56:15,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 21:56:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-13 21:56:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-13 21:56:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-01-13 21:56:15,603 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 12 [2019-01-13 21:56:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:15,603 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-01-13 21:56:15,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-01-13 21:56:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 21:56:15,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:15,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:15,605 INFO L423 AbstractCegarLoop]: === Iteration 2 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash 881745876, now seen corresponding path program 1 times [2019-01-13 21:56:15,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:15,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:15,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:15,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:15,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:15,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:15,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:15,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:15,930 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2019-01-13 21:56:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:16,534 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-01-13 21:56:16,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:16,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-13 21:56:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:16,537 INFO L225 Difference]: With dead ends: 65 [2019-01-13 21:56:16,538 INFO L226 Difference]: Without dead ends: 65 [2019-01-13 21:56:16,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-13 21:56:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-01-13 21:56:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-13 21:56:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2019-01-13 21:56:16,547 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 12 [2019-01-13 21:56:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:16,548 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2019-01-13 21:56:16,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2019-01-13 21:56:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 21:56:16,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:16,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:16,550 INFO L423 AbstractCegarLoop]: === Iteration 3 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1564318347, now seen corresponding path program 1 times [2019-01-13 21:56:16,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:16,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:16,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:16,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:16,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:16,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:16,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:16,624 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 3 states. [2019-01-13 21:56:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:16,748 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-01-13 21:56:16,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:16,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-13 21:56:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:16,751 INFO L225 Difference]: With dead ends: 59 [2019-01-13 21:56:16,753 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 21:56:16,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 21:56:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-13 21:56:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-13 21:56:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-01-13 21:56:16,765 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 13 [2019-01-13 21:56:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:16,765 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-01-13 21:56:16,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-01-13 21:56:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 21:56:16,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:16,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:16,767 INFO L423 AbstractCegarLoop]: === Iteration 4 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:16,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1564318348, now seen corresponding path program 1 times [2019-01-13 21:56:16,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:16,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:16,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:16,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:16,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:16,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:16,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:16,893 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 5 states. [2019-01-13 21:56:17,132 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-13 21:56:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:17,402 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-01-13 21:56:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:17,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-13 21:56:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:17,405 INFO L225 Difference]: With dead ends: 75 [2019-01-13 21:56:17,405 INFO L226 Difference]: Without dead ends: 75 [2019-01-13 21:56:17,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-13 21:56:17,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2019-01-13 21:56:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-13 21:56:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-01-13 21:56:17,413 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2019-01-13 21:56:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:17,413 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-01-13 21:56:17,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-01-13 21:56:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:56:17,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:17,415 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:17,416 INFO L423 AbstractCegarLoop]: === Iteration 5 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2082251687, now seen corresponding path program 1 times [2019-01-13 21:56:17,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:17,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:17,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:17,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:17,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:17,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:17,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:17,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:17,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-01-13 21:56:17,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:56:17,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:56:17,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:17,682 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 9 states. [2019-01-13 21:56:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:18,145 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2019-01-13 21:56:18,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:18,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-13 21:56:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:18,150 INFO L225 Difference]: With dead ends: 86 [2019-01-13 21:56:18,151 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 21:56:18,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 21:56:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2019-01-13 21:56:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 21:56:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-01-13 21:56:18,162 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 16 [2019-01-13 21:56:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:18,162 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-01-13 21:56:18,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:56:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-01-13 21:56:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:56:18,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:18,163 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:18,165 INFO L423 AbstractCegarLoop]: === Iteration 6 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:18,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1819688599, now seen corresponding path program 1 times [2019-01-13 21:56:18,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:18,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:18,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:18,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:18,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:18,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:18,516 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 13 treesize of output 16 [2019-01-13 21:56:18,534 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 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-13 21:56:18,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:18,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:21 [2019-01-13 21:56:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:18,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:18,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-01-13 21:56:18,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:18,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:18,669 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 7 states. [2019-01-13 21:56:18,948 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 21:56:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:19,125 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-01-13 21:56:19,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:19,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-13 21:56:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:19,128 INFO L225 Difference]: With dead ends: 89 [2019-01-13 21:56:19,128 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 21:56:19,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 21:56:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2019-01-13 21:56:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 21:56:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-01-13 21:56:19,138 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 16 [2019-01-13 21:56:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:19,138 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-01-13 21:56:19,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2019-01-13 21:56:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 21:56:19,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:19,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:19,139 INFO L423 AbstractCegarLoop]: === Iteration 7 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash -735692276, now seen corresponding path program 1 times [2019-01-13 21:56:19,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:19,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:19,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:19,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:19,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:19,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:19,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:19,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:19,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:19,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-13 21:56:19,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:19,380 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 8 states. [2019-01-13 21:56:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:19,646 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2019-01-13 21:56:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:19,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-13 21:56:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:19,650 INFO L225 Difference]: With dead ends: 140 [2019-01-13 21:56:19,651 INFO L226 Difference]: Without dead ends: 140 [2019-01-13 21:56:19,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-13 21:56:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 93. [2019-01-13 21:56:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-13 21:56:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2019-01-13 21:56:19,663 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 19 [2019-01-13 21:56:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:19,664 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-01-13 21:56:19,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2019-01-13 21:56:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:19,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:19,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:19,666 INFO L423 AbstractCegarLoop]: === Iteration 8 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -320521474, now seen corresponding path program 1 times [2019-01-13 21:56:19,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:19,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:19,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:19,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:19,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:19,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:19,810 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand 8 states. [2019-01-13 21:56:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:20,192 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2019-01-13 21:56:20,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:20,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-01-13 21:56:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:20,195 INFO L225 Difference]: With dead ends: 99 [2019-01-13 21:56:20,195 INFO L226 Difference]: Without dead ends: 99 [2019-01-13 21:56:20,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:56:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-13 21:56:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2019-01-13 21:56:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-13 21:56:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2019-01-13 21:56:20,203 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2019-01-13 21:56:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:20,203 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2019-01-13 21:56:20,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2019-01-13 21:56:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:20,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:20,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:20,206 INFO L423 AbstractCegarLoop]: === Iteration 9 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1027097369, now seen corresponding path program 2 times [2019-01-13 21:56:20,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:20,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:20,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:56:20,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:20,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:20,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:20,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:20,517 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 7 states. [2019-01-13 21:56:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:20,612 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-01-13 21:56:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:20,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-13 21:56:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:20,615 INFO L225 Difference]: With dead ends: 85 [2019-01-13 21:56:20,616 INFO L226 Difference]: Without dead ends: 85 [2019-01-13 21:56:20,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-13 21:56:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-13 21:56:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-13 21:56:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-01-13 21:56:20,622 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 23 [2019-01-13 21:56:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:20,623 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-01-13 21:56:20,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-01-13 21:56:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:20,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:20,626 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:20,626 INFO L423 AbstractCegarLoop]: === Iteration 10 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1027097368, now seen corresponding path program 1 times [2019-01-13 21:56:20,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:20,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:20,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:56:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:21,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:21,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:21,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:21,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:21,090 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 [2019-01-13 21:56:21,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,197 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 6 treesize of output 5 [2019-01-13 21:56:21,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2019-01-13 21:56:21,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:21,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:21,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:21,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:21,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-13 21:56:21,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2019-01-13 21:56:21,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:21,413 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:48, output treesize:43 [2019-01-13 21:56:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:21,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-01-13 21:56:21,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 21:56:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 21:56:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:56:21,766 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 15 states. [2019-01-13 21:56:22,261 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-13 21:56:23,337 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-01-13 21:56:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:24,055 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-01-13 21:56:24,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:56:24,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-01-13 21:56:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:24,057 INFO L225 Difference]: With dead ends: 129 [2019-01-13 21:56:24,058 INFO L226 Difference]: Without dead ends: 129 [2019-01-13 21:56:24,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-13 21:56:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2019-01-13 21:56:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-13 21:56:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-01-13 21:56:24,065 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 23 [2019-01-13 21:56:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:24,065 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-01-13 21:56:24,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 21:56:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2019-01-13 21:56:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:24,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:24,068 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] [2019-01-13 21:56:24,068 INFO L423 AbstractCegarLoop]: === Iteration 11 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash 794265272, now seen corresponding path program 1 times [2019-01-13 21:56:24,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:24,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:24,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:24,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:24,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:24,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:24,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:24,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 21:56:24,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-01-13 21:56:24,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:24,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:24,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:24,238 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 10 states. [2019-01-13 21:56:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:24,508 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2019-01-13 21:56:24,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:24,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-13 21:56:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:24,511 INFO L225 Difference]: With dead ends: 105 [2019-01-13 21:56:24,511 INFO L226 Difference]: Without dead ends: 105 [2019-01-13 21:56:24,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:56:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-13 21:56:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2019-01-13 21:56:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 21:56:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2019-01-13 21:56:24,518 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 24 [2019-01-13 21:56:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:24,519 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2019-01-13 21:56:24,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2019-01-13 21:56:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:24,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:24,520 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:24,520 INFO L423 AbstractCegarLoop]: === Iteration 12 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1775247340, now seen corresponding path program 1 times [2019-01-13 21:56:24,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:24,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:24,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 21:56:24,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:24,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:24,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:24,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:24,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:24,733 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 8 states. [2019-01-13 21:56:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:24,978 INFO L93 Difference]: Finished difference Result 144 states and 172 transitions. [2019-01-13 21:56:24,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:24,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-13 21:56:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:24,982 INFO L225 Difference]: With dead ends: 144 [2019-01-13 21:56:24,982 INFO L226 Difference]: Without dead ends: 144 [2019-01-13 21:56:24,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-13 21:56:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 106. [2019-01-13 21:56:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-13 21:56:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2019-01-13 21:56:24,988 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 24 [2019-01-13 21:56:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:24,988 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2019-01-13 21:56:24,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2019-01-13 21:56:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 21:56:24,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:24,992 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:24,992 INFO L423 AbstractCegarLoop]: === Iteration 13 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash -911344417, now seen corresponding path program 1 times [2019-01-13 21:56:24,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:24,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:24,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 21:56:25,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:25,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:25,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:25,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:25,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:25,196 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 4 states. [2019-01-13 21:56:25,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:25,313 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-01-13 21:56:25,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:25,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-13 21:56:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:25,319 INFO L225 Difference]: With dead ends: 123 [2019-01-13 21:56:25,319 INFO L226 Difference]: Without dead ends: 123 [2019-01-13 21:56:25,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-13 21:56:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2019-01-13 21:56:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-13 21:56:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2019-01-13 21:56:25,325 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 26 [2019-01-13 21:56:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:25,325 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-01-13 21:56:25,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2019-01-13 21:56:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:25,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:25,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:25,329 INFO L423 AbstractCegarLoop]: === Iteration 14 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1947880059, now seen corresponding path program 1 times [2019-01-13 21:56:25,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:25,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:25,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:25,634 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-01-13 21:56:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:25,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:25,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:25,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:25,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:25,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:56:25,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:25,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:25,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 21:56:25,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:56:25,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:56:25,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:25,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:25,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:25,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-13 21:56:25,955 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 19 treesize of output 20 [2019-01-13 21:56:25,958 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 [2019-01-13 21:56:25,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:25,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:25,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:25,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-01-13 21:56:26,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-13 21:56:26,029 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 [2019-01-13 21:56:26,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:26,039 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 5 treesize of output 1 [2019-01-13 21:56:26,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:26,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:26,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:26,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2019-01-13 21:56:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:26,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:26,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-13 21:56:26,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 21:56:26,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 21:56:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:26,089 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand 12 states. [2019-01-13 21:56:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:26,519 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2019-01-13 21:56:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:26,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-01-13 21:56:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:26,522 INFO L225 Difference]: With dead ends: 114 [2019-01-13 21:56:26,522 INFO L226 Difference]: Without dead ends: 114 [2019-01-13 21:56:26,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-01-13 21:56:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-13 21:56:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-01-13 21:56:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-13 21:56:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2019-01-13 21:56:26,527 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 28 [2019-01-13 21:56:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:26,527 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2019-01-13 21:56:26,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 21:56:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2019-01-13 21:56:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:26,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:26,529 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:26,530 INFO L423 AbstractCegarLoop]: === Iteration 15 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:26,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1012493537, now seen corresponding path program 1 times [2019-01-13 21:56:26,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:26,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:26,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:26,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:26,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 21:56:26,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:26,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:26,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:26,609 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand 3 states. [2019-01-13 21:56:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:26,680 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2019-01-13 21:56:26,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:26,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-13 21:56:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:26,683 INFO L225 Difference]: With dead ends: 112 [2019-01-13 21:56:26,683 INFO L226 Difference]: Without dead ends: 112 [2019-01-13 21:56:26,684 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 [2019-01-13 21:56:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-13 21:56:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-13 21:56:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-13 21:56:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-01-13 21:56:26,698 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 28 [2019-01-13 21:56:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:26,700 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-01-13 21:56:26,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-01-13 21:56:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:26,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:26,704 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:26,704 INFO L423 AbstractCegarLoop]: === Iteration 16 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:26,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1012484506, now seen corresponding path program 1 times [2019-01-13 21:56:26,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:26,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:26,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:26,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:26,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 21:56:27,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:27,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:27,314 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 8 states. [2019-01-13 21:56:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:27,533 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2019-01-13 21:56:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:27,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-01-13 21:56:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:27,535 INFO L225 Difference]: With dead ends: 112 [2019-01-13 21:56:27,536 INFO L226 Difference]: Without dead ends: 112 [2019-01-13 21:56:27,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-13 21:56:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-01-13 21:56:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-13 21:56:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2019-01-13 21:56:27,542 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2019-01-13 21:56:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:27,542 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2019-01-13 21:56:27,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2019-01-13 21:56:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 21:56:27,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:27,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:27,543 INFO L423 AbstractCegarLoop]: === Iteration 17 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash -167985506, now seen corresponding path program 1 times [2019-01-13 21:56:27,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:27,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:27,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 21:56:27,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:27,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:27,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:27,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:27,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:27,786 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 6 states. [2019-01-13 21:56:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:28,111 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2019-01-13 21:56:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:28,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-13 21:56:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:28,113 INFO L225 Difference]: With dead ends: 109 [2019-01-13 21:56:28,113 INFO L226 Difference]: Without dead ends: 61 [2019-01-13 21:56:28,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-13 21:56:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-13 21:56:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-13 21:56:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-01-13 21:56:28,118 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 30 [2019-01-13 21:56:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:28,119 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-01-13 21:56:28,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-01-13 21:56:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 21:56:28,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:28,119 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:28,120 INFO L423 AbstractCegarLoop]: === Iteration 18 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash -348897415, now seen corresponding path program 1 times [2019-01-13 21:56:28,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:28,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:28,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:28,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 21:56:28,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:28,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 21:56:28,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:28,333 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 8 states. [2019-01-13 21:56:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:28,576 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-01-13 21:56:28,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:28,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-13 21:56:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:28,578 INFO L225 Difference]: With dead ends: 60 [2019-01-13 21:56:28,579 INFO L226 Difference]: Without dead ends: 60 [2019-01-13 21:56:28,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-13 21:56:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-01-13 21:56:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-13 21:56:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-01-13 21:56:28,582 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 31 [2019-01-13 21:56:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:28,582 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-01-13 21:56:28,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-01-13 21:56:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 21:56:28,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:28,583 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:28,585 INFO L423 AbstractCegarLoop]: === Iteration 19 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash -283633916, now seen corresponding path program 1 times [2019-01-13 21:56:28,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:28,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:28,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:28,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:28,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:28,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:28,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:28,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 21:56:28,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:28,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-01-13 21:56:28,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 21:56:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 21:56:28,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:56:28,902 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 17 states. [2019-01-13 21:56:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:29,350 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-01-13 21:56:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 21:56:29,352 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-01-13 21:56:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:29,353 INFO L225 Difference]: With dead ends: 109 [2019-01-13 21:56:29,353 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 21:56:29,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-01-13 21:56:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 21:56:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2019-01-13 21:56:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 21:56:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-01-13 21:56:29,356 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 33 [2019-01-13 21:56:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:29,357 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-01-13 21:56:29,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 21:56:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-01-13 21:56:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 21:56:29,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:29,357 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:29,358 INFO L423 AbstractCegarLoop]: === Iteration 20 === [lisErr17REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 21:56:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2057436831, now seen corresponding path program 2 times [2019-01-13 21:56:29,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:29,525 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-13 21:56:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-13 21:56:29,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:29,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:29,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:29,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 21:56:29,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:29,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:29,739 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 6 treesize of output 5 [2019-01-13 21:56:29,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,750 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 [2019-01-13 21:56:29,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2019-01-13 21:56:29,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:29,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:29,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:29,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:29,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-13 21:56:29,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2019-01-13 21:56:29,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:29,936 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:45, output treesize:40 [2019-01-13 21:56:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-13 21:56:30,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-01-13 21:56:30,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 21:56:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 21:56:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:56:30,197 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 13 states. [2019-01-13 21:56:30,734 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-01-13 21:56:31,459 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-01-13 21:56:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:31,835 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-01-13 21:56:31,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:31,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-01-13 21:56:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:31,843 INFO L225 Difference]: With dead ends: 62 [2019-01-13 21:56:31,843 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:56:31,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:56:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:56:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:56:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:56:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:56:31,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-01-13 21:56:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:31,845 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:56:31,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 21:56:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:56:31,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:56:31,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:56:31 BoogieIcfgContainer [2019-01-13 21:56:31,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:56:31,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:56:31,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:56:31,853 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:56:31,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:14" (3/4) ... [2019-01-13 21:56:31,857 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:56:31,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:56:31,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lis [2019-01-13 21:56:31,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:56:31,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:56:31,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:56:31,870 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-13 21:56:31,870 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-13 21:56:31,871 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 21:56:31,937 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:56:31,941 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:56:31,943 INFO L168 Benchmark]: Toolchain (without parser) took 18768.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 952.7 MB in the beginning and 819.7 MB in the end (delta: 133.0 MB). Peak memory consumption was 420.3 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:31,944 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:31,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -125.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:31,945 INFO L168 Benchmark]: Boogie Preprocessor took 68.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:31,946 INFO L168 Benchmark]: RCFGBuilder took 908.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:31,947 INFO L168 Benchmark]: TraceAbstraction took 17063.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 819.7 MB in the end (delta: 205.9 MB). Peak memory consumption was 394.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:31,948 INFO L168 Benchmark]: Witness Printer took 89.79 ms. Allocated memory is still 1.3 GB. Free memory was 819.7 MB in the beginning and 819.7 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-13 21:56:31,952 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -125.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 908.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17063.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 819.7 MB in the end (delta: 205.9 MB). Peak memory consumption was 394.7 MB. Max. memory is 11.5 GB. * Witness Printer took 89.79 ms. Allocated memory is still 1.3 GB. Free memory was 819.7 MB in the beginning and 819.7 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: 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: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: 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: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 75 locations, 23 error locations. SAFE Result, 16.9s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 795 SDtfs, 2496 SDslu, 1912 SDs, 0 SdLazy, 2081 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 186 SyntacticMatches, 13 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 223 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 652 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 624 ConstructedInterpolants, 50 QuantifiedInterpolants, 137509 SizeOfPredicates, 49 NumberOfNonLiveVariables, 940 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 95/134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...