./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f6e8c8b965f85c3429105401e9fda59f9f060cb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:12:50,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:12:50,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:12:50,185 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:12:50,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:12:50,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:12:50,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:12:50,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:12:50,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:12:50,193 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:12:50,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:12:50,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:12:50,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:12:50,197 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:12:50,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:12:50,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:12:50,201 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:12:50,203 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:12:50,205 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:12:50,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:12:50,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:12:50,210 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:12:50,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:12:50,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:12:50,214 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:12:50,215 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:12:50,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:12:50,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:12:50,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:12:50,220 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:12:50,220 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:12:50,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:12:50,221 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:12:50,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:12:50,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:12:50,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:12:50,225 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:12:50,254 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:12:50,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:12:50,256 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:12:50,256 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:12:50,256 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:12:50,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:12:50,262 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:12:50,262 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:12:50,262 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:12:50,262 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:12:50,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:12:50,263 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:12:50,264 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:12:50,264 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:12:50,264 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:12:50,264 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:12:50,264 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:12:50,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:12:50,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:12:50,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:12:50,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:12:50,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:12:50,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:12:50,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:12:50,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:12:50,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:12:50,268 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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2019-01-01 17:12:50,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:12:50,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:12:50,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:12:50,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:12:50,334 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:12:50,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:50,396 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3b9ef34/2bd8aeb079564042a7157a0fe14657c6/FLAG6f6726463 [2019-01-01 17:12:51,006 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:12:51,011 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:51,027 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3b9ef34/2bd8aeb079564042a7157a0fe14657c6/FLAG6f6726463 [2019-01-01 17:12:51,273 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3b9ef34/2bd8aeb079564042a7157a0fe14657c6 [2019-01-01 17:12:51,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:12:51,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:12:51,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:12:51,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:12:51,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:12:51,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:51,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420f99b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51, skipping insertion in model container [2019-01-01 17:12:51,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:51,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:12:51,349 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:12:51,706 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:12:51,718 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:12:51,782 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:12:51,935 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:12:51,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51 WrapperNode [2019-01-01 17:12:51,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:12:51,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:12:51,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:12:51,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:12:51,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:51,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:51,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:51,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:51,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:51,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:51,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (1/1) ... [2019-01-01 17:12:52,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:12:52,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:12:52,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:12:52,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:12:52,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:12:52,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:12:52,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:12:52,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:12:52,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:12:52,057 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2019-01-01 17:12:52,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:12:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:12:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:12:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:12:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:12:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:12:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:12:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:12:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:12:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:12:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:12:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:12:52,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:12:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:12:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:12:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:12:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:12:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:12:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:12:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:12:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:12:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:12:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:12:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:12:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:12:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:12:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:12:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:12:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:12:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:12:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:12:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:12:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:12:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:12:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:12:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:12:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:12:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:12:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:12:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:12:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:12:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:12:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:12:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:12:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:12:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:12:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:12:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:12:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:12:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:12:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:12:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:12:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:12:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:12:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:12:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:12:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:12:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:12:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:12:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:12:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:12:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:12:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:12:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:12:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:12:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:12:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:12:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:12:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:12:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:12:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:12:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:12:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:12:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:12:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:12:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:12:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:12:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:12:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:12:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:12:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:12:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:12:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:12:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:12:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:12:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:12:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:12:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:12:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:12:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:12:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:12:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:12:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:12:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2019-01-01 17:12:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:12:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:12:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:12:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:12:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:12:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:12:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:12:52,879 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:12:52,881 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 17:12:52,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:52 BoogieIcfgContainer [2019-01-01 17:12:52,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:12:52,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:12:52,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:12:52,888 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:12:52,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:12:51" (1/3) ... [2019-01-01 17:12:52,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f89b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:12:52, skipping insertion in model container [2019-01-01 17:12:52,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:51" (2/3) ... [2019-01-01 17:12:52,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f89b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:12:52, skipping insertion in model container [2019-01-01 17:12:52,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:52" (3/3) ... [2019-01-01 17:12:52,892 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:52,903 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:12:52,917 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-01 17:12:52,935 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-01 17:12:52,963 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:12:52,964 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:12:52,964 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:12:52,964 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:12:52,964 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:12:52,965 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:12:52,965 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:12:52,965 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:12:52,965 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:12:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-01 17:12:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:52,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:53,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:53,004 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097680, now seen corresponding path program 1 times [2019-01-01 17:12:53,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:53,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:53,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:53,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:53,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:12:53,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:12:53,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:12:53,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:53,256 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-01-01 17:12:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:53,351 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-01-01 17:12:53,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:12:53,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:12:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:53,366 INFO L225 Difference]: With dead ends: 48 [2019-01-01 17:12:53,367 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:12:53,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:12:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-01 17:12:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:12:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-01-01 17:12:53,413 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2019-01-01 17:12:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:53,413 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-01-01 17:12:53,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:12:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-01-01 17:12:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:53,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:53,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:53,415 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097681, now seen corresponding path program 1 times [2019-01-01 17:12:53,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:53,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:53,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:53,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:53,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:53,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:53,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:12:53,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:12:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:53,576 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2019-01-01 17:12:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:53,633 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-01 17:12:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:12:53,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:12:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:53,636 INFO L225 Difference]: With dead ends: 44 [2019-01-01 17:12:53,636 INFO L226 Difference]: Without dead ends: 44 [2019-01-01 17:12:53,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-01 17:12:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-01 17:12:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 17:12:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-01-01 17:12:53,645 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2019-01-01 17:12:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:53,645 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-01-01 17:12:53,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:12:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-01-01 17:12:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:12:53,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:53,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:53,648 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash 774453223, now seen corresponding path program 1 times [2019-01-01 17:12:53,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:53,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:53,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:53,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:12:53,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:12:53,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:12:53,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:53,733 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2019-01-01 17:12:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:53,809 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-01 17:12:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:12:53,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 17:12:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:53,811 INFO L225 Difference]: With dead ends: 43 [2019-01-01 17:12:53,811 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 17:12:53,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 17:12:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-01 17:12:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:12:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-01 17:12:53,818 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2019-01-01 17:12:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:53,819 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-01 17:12:53,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:12:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-01 17:12:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:12:53,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:53,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:53,821 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 774453224, now seen corresponding path program 1 times [2019-01-01 17:12:53,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:53,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:53,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:53,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:53,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:12:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:12:53,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:53,906 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2019-01-01 17:12:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:53,934 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-01-01 17:12:53,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:12:53,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-01 17:12:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:53,937 INFO L225 Difference]: With dead ends: 42 [2019-01-01 17:12:53,937 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 17:12:53,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 17:12:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-01 17:12:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 17:12:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-01 17:12:53,943 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2019-01-01 17:12:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:53,944 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-01 17:12:53,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:12:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-01 17:12:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:12:53,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:53,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:53,945 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash -828291016, now seen corresponding path program 1 times [2019-01-01 17:12:53,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:53,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:53,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:54,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:54,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:12:54,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:12:54,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:12:54,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:12:54,020 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2019-01-01 17:12:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:54,418 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-01 17:12:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:12:54,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-01 17:12:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:54,420 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:12:54,420 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:12:54,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:12:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 17:12:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:12:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-01 17:12:54,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2019-01-01 17:12:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:54,435 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-01 17:12:54,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:12:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-01 17:12:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:12:54,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:54,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:54,437 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:54,438 INFO L82 PathProgramCache]: Analyzing trace with hash -828291015, now seen corresponding path program 1 times [2019-01-01 17:12:54,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:54,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:54,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:54,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:54,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:54,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:54,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:12:54,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:12:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:12:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:12:54,617 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2019-01-01 17:12:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:54,844 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-01-01 17:12:54,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:12:54,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-01 17:12:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:54,849 INFO L225 Difference]: With dead ends: 62 [2019-01-01 17:12:54,850 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 17:12:54,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:12:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 17:12:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2019-01-01 17:12:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:12:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-01 17:12:54,858 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2019-01-01 17:12:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:54,858 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-01 17:12:54,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:12:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-01 17:12:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:12:54,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:54,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:54,860 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695426, now seen corresponding path program 1 times [2019-01-01 17:12:54,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:54,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:54,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:54,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:54,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:54,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:12:54,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:12:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:12:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:54,958 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2019-01-01 17:12:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:55,114 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-01 17:12:55,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:12:55,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-01 17:12:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:55,117 INFO L225 Difference]: With dead ends: 43 [2019-01-01 17:12:55,117 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 17:12:55,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:12:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 17:12:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-01 17:12:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:12:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-01 17:12:55,122 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2019-01-01 17:12:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:55,123 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-01 17:12:55,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:12:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-01-01 17:12:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:12:55,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:55,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:55,124 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695425, now seen corresponding path program 1 times [2019-01-01 17:12:55,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:55,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:55,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:55,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:55,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:55,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:55,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:12:55,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:12:55,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:12:55,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:12:55,295 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-01-01 17:12:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:55,483 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-01-01 17:12:55,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:12:55,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-01 17:12:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:55,485 INFO L225 Difference]: With dead ends: 55 [2019-01-01 17:12:55,485 INFO L226 Difference]: Without dead ends: 55 [2019-01-01 17:12:55,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:12:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-01 17:12:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-01-01 17:12:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 17:12:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-01-01 17:12:55,491 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2019-01-01 17:12:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:55,492 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-01-01 17:12:55,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:12:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-01-01 17:12:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:12:55,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:55,493 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-01 17:12:55,493 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash -145313269, now seen corresponding path program 1 times [2019-01-01 17:12:55,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:55,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:55,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:55,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:55,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:55,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:12:55,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:12:55,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:55,613 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2019-01-01 17:12:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:55,732 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-01-01 17:12:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:12:55,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-01 17:12:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:55,734 INFO L225 Difference]: With dead ends: 46 [2019-01-01 17:12:55,734 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:12:55,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:12:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-01 17:12:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:12:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-01 17:12:55,739 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2019-01-01 17:12:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:55,739 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-01 17:12:55,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:12:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-01 17:12:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:12:55,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:55,740 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] [2019-01-01 17:12:55,741 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:55,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1476836758, now seen corresponding path program 1 times [2019-01-01 17:12:55,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:55,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:55,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:55,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:55,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:55,784 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-01 17:12:55,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:55,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:55,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:12:55,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:12:55,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:55,786 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2019-01-01 17:12:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:55,797 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-01 17:12:55,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:12:55,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-01 17:12:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:55,798 INFO L225 Difference]: With dead ends: 43 [2019-01-01 17:12:55,798 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 17:12:55,799 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-01 17:12:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 17:12:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-01 17:12:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:12:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-01 17:12:55,804 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2019-01-01 17:12:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:55,806 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-01 17:12:55,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:12:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-01 17:12:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:12:55,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:55,807 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-01 17:12:55,807 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1895057779, now seen corresponding path program 1 times [2019-01-01 17:12:55,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:55,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:56,176 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-01 17:12:56,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:56,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:12:56,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:12:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:12:56,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:12:56,178 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2019-01-01 17:12:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:56,748 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-01-01 17:12:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:12:56,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-01 17:12:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:56,750 INFO L225 Difference]: With dead ends: 64 [2019-01-01 17:12:56,750 INFO L226 Difference]: Without dead ends: 64 [2019-01-01 17:12:56,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:12:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-01 17:12:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-01-01 17:12:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 17:12:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-01-01 17:12:56,755 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2019-01-01 17:12:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:56,756 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-01 17:12:56,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:12:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-01-01 17:12:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:12:56,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:56,757 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-01 17:12:56,757 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:12:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash 306709877, now seen corresponding path program 1 times [2019-01-01 17:12:56,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:56,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:56,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:57,140 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-01 17:12:57,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:12:57,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:12:57,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:57,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:12:57,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:12:57,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-01 17:12:57,357 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 11 treesize of output 8 [2019-01-01 17:12:57,359 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-01 17:12:57,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-01 17:12:57,492 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 22 treesize of output 23 [2019-01-01 17:12:57,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:12:57,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 17:12:57,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2019-01-01 17:12:57,885 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 25 treesize of output 23 [2019-01-01 17:12:57,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-01 17:12:57,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,898 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-01 17:12:57,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:57,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2019-01-01 17:12:57,964 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-01 17:12:57,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 17:12:57,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2019-01-01 17:12:57,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 17:12:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 17:12:57,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-01-01 17:12:57,986 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 19 states. [2019-01-01 17:12:58,266 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 17:13:00,805 WARN L181 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 17:13:03,559 WARN L181 SmtUtils]: Spent 2.68 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 17:13:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:04,183 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-01 17:13:04,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 17:13:04,185 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-01-01 17:13:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:04,187 INFO L225 Difference]: With dead ends: 101 [2019-01-01 17:13:04,188 INFO L226 Difference]: Without dead ends: 86 [2019-01-01 17:13:04,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 17:13:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-01 17:13:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-01-01 17:13:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 17:13:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-01-01 17:13:04,195 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2019-01-01 17:13:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:04,196 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-01-01 17:13:04,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 17:13:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-01-01 17:13:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:13:04,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:04,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:04,199 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1403727160, now seen corresponding path program 1 times [2019-01-01 17:13:04,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:04,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:04,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:04,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:04,332 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-01 17:13:04,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:04,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:13:04,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:13:04,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:13:04,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:04,337 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 10 states. [2019-01-01 17:13:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:04,588 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-01-01 17:13:04,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:13:04,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-01-01 17:13:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:04,591 INFO L225 Difference]: With dead ends: 69 [2019-01-01 17:13:04,591 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 17:13:04,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-01-01 17:13:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 17:13:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-01-01 17:13:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 17:13:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-01-01 17:13:04,596 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 25 [2019-01-01 17:13:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:04,596 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-01-01 17:13:04,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:13:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-01-01 17:13:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:13:04,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:04,599 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] [2019-01-01 17:13:04,599 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:04,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:04,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2074932103, now seen corresponding path program 1 times [2019-01-01 17:13:04,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:04,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:04,983 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2019-01-01 17:13:05,264 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-01 17:13:05,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:05,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:05,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:05,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:05,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:13:05,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:05,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:05,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-01 17:13:05,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:13:05,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:13:05,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:05,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:05,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:05,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-01 17:13:05,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-01 17:13:05,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:13:05,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:05,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:05,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:05,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-01 17:13:10,209 WARN L181 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 17:13:10,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2019-01-01 17:13:10,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-01-01 17:13:10,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-01 17:13:10,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2019-01-01 17:13:10,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:10,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-01 17:13:10,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:10,774 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 35 treesize of output 27 [2019-01-01 17:13:10,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:10,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2019-01-01 17:13:10,917 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:11,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-01 17:13:11,097 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:11,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2019-01-01 17:13:11,114 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:11,397 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 37 treesize of output 29 [2019-01-01 17:13:11,398 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:11,612 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 23 treesize of output 16 [2019-01-01 17:13:11,613 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:11,616 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 27 treesize of output 20 [2019-01-01 17:13:11,617 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:11,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2019-01-01 17:13:11,747 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-01 17:13:11,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-01 17:13:11,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:13:11,961 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2019-01-01 17:13:12,159 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-01 17:13:12,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:12,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2019-01-01 17:13:12,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 17:13:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 17:13:12,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2019-01-01 17:13:12,188 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 28 states. [2019-01-01 17:13:14,999 WARN L181 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-01-01 17:13:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:16,331 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2019-01-01 17:13:16,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 17:13:16,339 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-01-01 17:13:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:16,340 INFO L225 Difference]: With dead ends: 109 [2019-01-01 17:13:16,340 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 17:13:16,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 17:13:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 17:13:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2019-01-01 17:13:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-01 17:13:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-01-01 17:13:16,347 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 27 [2019-01-01 17:13:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:16,348 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-01-01 17:13:16,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 17:13:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-01-01 17:13:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:13:16,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:16,349 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] [2019-01-01 17:13:16,349 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:16,349 INFO L82 PathProgramCache]: Analyzing trace with hash -729755417, now seen corresponding path program 1 times [2019-01-01 17:13:16,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:16,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:16,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:16,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:16,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:16,767 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-01 17:13:17,026 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-01 17:13:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:17,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:17,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:17,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:17,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:17,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:17,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:13:17,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:17,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:17,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:17,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-01 17:13:17,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 17:13:17,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:13:17,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:17,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:17,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:17,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-01 17:13:17,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-01 17:13:17,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 17:13:17,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:17,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:17,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:17,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-01 17:13:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:17,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:17,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-01-01 17:13:17,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 17:13:17,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 17:13:17,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:13:17,927 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 22 states. [2019-01-01 17:13:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:19,493 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-01-01 17:13:19,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:13:19,495 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-01-01 17:13:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:19,497 INFO L225 Difference]: With dead ends: 92 [2019-01-01 17:13:19,497 INFO L226 Difference]: Without dead ends: 90 [2019-01-01 17:13:19,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 17:13:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-01 17:13:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2019-01-01 17:13:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 17:13:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-01-01 17:13:19,509 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2019-01-01 17:13:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:19,510 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-01-01 17:13:19,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 17:13:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-01-01 17:13:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 17:13:19,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:19,511 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:19,511 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:13:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1281582983, now seen corresponding path program 2 times [2019-01-01 17:13:19,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:19,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:19,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:19,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:19,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:19,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:19,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:19,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:19,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:20,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:13:20,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:20,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:20,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-01-01 17:13:20,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:13:20,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:13:20,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:20,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:20,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:20,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2019-01-01 17:13:20,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-01 17:13:20,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:13:20,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:20,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:20,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:20,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2019-01-01 17:13:21,930 WARN L181 SmtUtils]: Spent 754.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 17:13:22,997 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 55 treesize of output 45 [2019-01-01 17:13:23,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:23,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:23,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:23,149 INFO L303 Elim1Store]: Index analysis took 150 ms [2019-01-01 17:13:23,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 33 [2019-01-01 17:13:23,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:23,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2019-01-01 17:13:23,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:23,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-01 17:13:23,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:23,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:23,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:23,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:51 [2019-01-01 17:13:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:23,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:23,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22] total 28 [2019-01-01 17:13:23,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 17:13:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 17:13:23,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=734, Unknown=1, NotChecked=0, Total=812 [2019-01-01 17:13:23,372 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 29 states. [2019-01-01 17:13:24,376 WARN L181 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-01-01 17:13:25,055 WARN L181 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-01 17:13:25,570 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-01 17:13:25,782 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-01 17:13:26,051 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-01 17:13:26,239 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-01 17:13:26,717 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-01-01 17:13:27,005 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-01-01 17:13:27,227 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-01-01 17:13:27,401 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-01 17:13:27,911 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-01 17:13:28,138 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-01-01 17:13:31,070 WARN L181 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-01-01 17:13:36,490 WARN L181 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-01-01 17:13:43,252 WARN L181 SmtUtils]: Spent 6.69 s on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-01-01 17:13:45,792 WARN L181 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-01 17:13:48,495 WARN L181 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-01 17:13:50,950 WARN L181 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-01 17:13:53,500 WARN L181 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-01-01 17:13:53,823 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-01-01 17:13:57,051 WARN L181 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-01-01 17:13:59,507 WARN L181 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-01-01 17:14:01,833 WARN L181 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-01-01 17:14:05,274 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-01-01 17:14:07,172 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-01-01 17:14:08,388 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-01-01 17:14:14,374 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-01-01 17:14:16,075 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-01-01 17:14:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:16,272 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2019-01-01 17:14:16,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-01 17:14:16,274 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2019-01-01 17:14:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:16,276 INFO L225 Difference]: With dead ends: 120 [2019-01-01 17:14:16,276 INFO L226 Difference]: Without dead ends: 120 [2019-01-01 17:14:16,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=551, Invalid=3473, Unknown=8, NotChecked=0, Total=4032 [2019-01-01 17:14:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-01 17:14:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2019-01-01 17:14:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 17:14:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-01-01 17:14:16,288 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 40 [2019-01-01 17:14:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:16,288 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-01-01 17:14:16,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 17:14:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-01-01 17:14:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-01 17:14:16,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:16,290 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:16,290 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2019-01-01 17:14:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash 178768069, now seen corresponding path program 1 times [2019-01-01 17:14:16,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:16,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:16,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:14:16,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:17,198 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-01 17:14:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 17:14:17,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:17,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:14:17,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:17,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:17,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:14:17,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:14:17,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:14:17,519 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,534 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-01 17:14:17,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 17:14:17,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:14:17,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-01 17:14:17,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-01 17:14:17,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-01 17:14:17,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:17,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:17,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-01 17:14:20,199 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 17:14:20,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2019-01-01 17:14:20,295 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 48 treesize of output 41 [2019-01-01 17:14:20,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:20,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-01-01 17:14:20,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:20,430 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 40 treesize of output 30 [2019-01-01 17:14:20,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:20,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2019-01-01 17:14:20,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:20,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-01-01 17:14:20,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:21,169 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-01 17:14:21,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2019-01-01 17:14:21,182 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2019-01-01 17:14:21,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2019-01-01 17:14:21,359 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:21,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-01 17:14:21,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:14:21,535 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2019-01-01 17:14:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:14:21,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:21,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2019-01-01 17:14:21,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-01 17:14:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-01 17:14:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 17:14:21,744 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 33 states. [2019-01-01 17:14:24,498 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-01-01 17:14:24,658 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-01 17:14:24,992 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-01 17:14:25,182 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-01 17:14:25,491 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-01-01 17:14:26,204 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-01 17:14:27,930 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-01-01 17:14:30,423 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-01 17:14:34,586 WARN L181 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-01 17:14:34,748 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-01 17:14:37,341 WARN L181 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-01 17:14:41,793 WARN L181 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-01-01 17:14:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:42,474 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2019-01-01 17:14:42,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-01 17:14:42,475 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2019-01-01 17:14:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:42,476 INFO L225 Difference]: With dead ends: 103 [2019-01-01 17:14:42,476 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:14:42,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2019-01-01 17:14:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:14:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:14:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:14:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:14:42,479 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-01-01 17:14:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:42,481 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:14:42,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-01 17:14:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:14:42,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:14:42,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:14:42 BoogieIcfgContainer [2019-01-01 17:14:42,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:14:42,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:14:42,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:14:42,490 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:14:42,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:52" (3/4) ... [2019-01-01 17:14:42,496 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:14:42,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:14:42,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:14:42,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:14:42,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:14:42,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2019-01-01 17:14:42,515 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-01 17:14:42,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-01 17:14:42,517 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:14:42,579 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:14:42,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:14:42,581 INFO L168 Benchmark]: Toolchain (without parser) took 111302.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -373.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:42,582 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:42,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:42,582 INFO L168 Benchmark]: Boogie Preprocessor took 64.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:42,582 INFO L168 Benchmark]: RCFGBuilder took 879.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:42,583 INFO L168 Benchmark]: TraceAbstraction took 109606.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -246.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:42,583 INFO L168 Benchmark]: Witness Printer took 89.14 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:42,585 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 656.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 879.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109606.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -246.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 89.14 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: 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: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 15 error locations. SAFE Result, 109.5s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 87.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 504 SDtfs, 1540 SDslu, 1928 SDs, 0 SdLazy, 3381 SolverSat, 274 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2427 ImplicationChecksByTransitivity, 87.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 163 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 535 ConstructedInterpolants, 89 QuantifiedInterpolants, 319687 SizeOfPredicates, 79 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 73/173 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...