./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-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 cbb495583d601bf9f19d9da57531415381b22d5a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:43:54,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:43:54,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:43:54,076 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:43:54,076 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:43:54,077 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:43:54,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:43:54,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:43:54,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:43:54,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:43:54,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:43:54,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:43:54,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:43:54,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:43:54,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:43:54,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:43:54,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:43:54,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:43:54,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:43:54,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:43:54,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:43:54,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:43:54,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:43:54,099 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:43:54,099 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:43:54,100 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:43:54,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:43:54,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:43:54,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:43:54,104 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:43:54,104 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:43:54,105 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:43:54,105 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:43:54,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:43:54,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:43:54,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:43:54,108 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:43:54,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:43:54,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:43:54,129 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:43:54,129 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:43:54,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:43:54,130 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:43:54,130 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:43:54,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:43:54,131 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:43:54,131 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:43:54,131 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:43:54,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:43:54,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:43:54,131 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:43:54,132 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:43:54,132 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:43:54,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:43:54,132 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:43:54,132 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:43:54,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:43:54,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:43:54,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:43:54,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:43:54,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:54,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:43:54,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:43:54,134 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:43:54,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:43:54,134 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 -> cbb495583d601bf9f19d9da57531415381b22d5a [2018-11-28 22:43:54,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:43:54,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:43:54,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:43:54,218 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:43:54,218 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:43:54,219 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:54,282 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75806eb27/9ccf141c546441e6b714de63608e1ea2/FLAG06da25fcd [2018-11-28 22:43:54,823 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:43:54,824 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:54,843 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75806eb27/9ccf141c546441e6b714de63608e1ea2/FLAG06da25fcd [2018-11-28 22:43:55,248 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75806eb27/9ccf141c546441e6b714de63608e1ea2 [2018-11-28 22:43:55,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:43:55,256 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:43:55,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:55,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:43:55,262 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:43:55,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:55,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a69fda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55, skipping insertion in model container [2018-11-28 22:43:55,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:55,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:43:55,325 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:43:55,728 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:55,744 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:43:55,879 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:55,935 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:43:55,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55 WrapperNode [2018-11-28 22:43:55,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:55,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:43:55,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:43:55,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:43:55,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:55,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:55,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:55,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:55,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:56,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:56,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (1/1) ... [2018-11-28 22:43:56,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:43:56,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:43:56,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:43:56,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:43:56,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:43:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:43:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:43:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:43:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-11-28 22:43:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:43:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:43:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:43:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:43:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:43:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:43:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:43:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:43:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:43:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:43:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:43:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:43:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:43:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:43:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:43:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:43:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:43:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:43:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:43:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:43:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:43:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:43:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:43:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:43:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:43:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:43:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:43:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:43:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:43:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:43:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:43:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:43:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:43:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:43:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:43:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:43:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:43:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:43:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:43:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:43:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:43:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:43:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:43:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:43:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:43:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:43:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:43:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:43:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:43:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:43:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:43:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:43:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:43:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:43:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:43:56,123 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:43:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:43:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:43:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:43:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:43:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:43:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:43:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:43:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:43:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:43:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:43:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:43:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:43:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:43:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:43:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:43:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:43:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:43:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:43:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:43:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:43:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:43:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:43:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:43:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:43:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:43:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:43:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:43:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:43:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:43:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:43:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:43:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:43:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:43:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:43:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:43:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:43:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:43:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:43:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:43:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:43:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:43:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:43:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:43:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:43:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:43:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:43:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:43:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:43:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-11-28 22:43:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:43:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:43:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:43:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:43:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:43:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:43:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:43:56,912 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:43:56,912 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 22:43:56,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:56 BoogieIcfgContainer [2018-11-28 22:43:56,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:43:56,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:43:56,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:43:56,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:43:56,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:43:55" (1/3) ... [2018-11-28 22:43:56,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6de7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:56, skipping insertion in model container [2018-11-28 22:43:56,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:55" (2/3) ... [2018-11-28 22:43:56,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6de7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:56, skipping insertion in model container [2018-11-28 22:43:56,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:56" (3/3) ... [2018-11-28 22:43:56,923 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:56,933 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:43:56,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-11-28 22:43:56,961 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-11-28 22:43:56,989 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:43:56,990 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:43:56,990 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:43:56,990 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:43:56,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:43:56,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:43:56,991 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:43:56,991 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:43:56,991 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:43:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-28 22:43:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:57,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:57,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:57,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:57,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1974220600, now seen corresponding path program 1 times [2018-11-28 22:43:57,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:57,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:57,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:57,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:57,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:57,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:57,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:57,270 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-11-28 22:43:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:57,494 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-28 22:43:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:57,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:57,507 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:43:57,507 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:43:57,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:43:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:43:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:43:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-28 22:43:57,555 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 10 [2018-11-28 22:43:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:57,555 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-28 22:43:57,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-28 22:43:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:57,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:57,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:57,557 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:57,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:57,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1974220599, now seen corresponding path program 1 times [2018-11-28 22:43:57,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:57,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:57,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:57,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:57,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:57,759 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2018-11-28 22:43:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:57,819 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-28 22:43:57,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:57,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:57,821 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:43:57,821 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:43:57,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:43:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:43:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:43:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-28 22:43:57,829 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 10 [2018-11-28 22:43:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:57,829 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-28 22:43:57,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-28 22:43:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:43:57,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:57,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:57,830 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:57,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1071296429, now seen corresponding path program 1 times [2018-11-28 22:43:57,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:57,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:57,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:57,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:57,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:57,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:57,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:57,896 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2018-11-28 22:43:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:58,083 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-28 22:43:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:58,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 22:43:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:58,085 INFO L225 Difference]: With dead ends: 39 [2018-11-28 22:43:58,085 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 22:43:58,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:58,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 22:43:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 22:43:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:43:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 22:43:58,092 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2018-11-28 22:43:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:58,092 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 22:43:58,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-28 22:43:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:43:58,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:58,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:58,093 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:58,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:58,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1071296428, now seen corresponding path program 1 times [2018-11-28 22:43:58,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:58,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:58,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:58,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:58,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:58,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:58,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:58,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:58,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:58,227 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2018-11-28 22:43:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:58,290 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-28 22:43:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:58,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 22:43:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:58,294 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:43:58,294 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 22:43:58,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 22:43:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 22:43:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:43:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-28 22:43:58,300 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 11 [2018-11-28 22:43:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:58,300 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-28 22:43:58,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-28 22:43:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:58,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:58,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:58,302 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:58,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash 910096825, now seen corresponding path program 1 times [2018-11-28 22:43:58,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:58,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:58,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:58,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:43:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:43:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:58,377 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-11-28 22:43:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:58,627 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-28 22:43:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:58,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 22:43:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:58,629 INFO L225 Difference]: With dead ends: 36 [2018-11-28 22:43:58,629 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 22:43:58,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 22:43:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-28 22:43:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 22:43:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-28 22:43:58,634 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2018-11-28 22:43:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:58,635 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-28 22:43:58,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:43:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-28 22:43:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:58,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:58,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:58,636 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:58,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash 910096826, now seen corresponding path program 1 times [2018-11-28 22:43:58,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:58,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:58,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:58,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:58,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:58,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:58,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:43:58,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:43:58,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:58,796 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 7 states. [2018-11-28 22:43:58,989 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 22:43:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,303 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-28 22:43:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:59,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-28 22:43:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,307 INFO L225 Difference]: With dead ends: 50 [2018-11-28 22:43:59,307 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 22:43:59,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:43:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 22:43:59,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-11-28 22:43:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:43:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-28 22:43:59,315 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2018-11-28 22:43:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,315 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-28 22:43:59,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:43:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-28 22:43:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:43:59,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:59,316 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1570280198, now seen corresponding path program 1 times [2018-11-28 22:43:59,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:59,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:59,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:43:59,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:59,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:59,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:59,433 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 6 states. [2018-11-28 22:43:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,606 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-28 22:43:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:59,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 22:43:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,609 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:43:59,609 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:43:59,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:43:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:43:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:43:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-28 22:43:59,615 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 16 [2018-11-28 22:43:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,616 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 22:43:59,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-28 22:43:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:43:59,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:59,617 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1570280197, now seen corresponding path program 1 times [2018-11-28 22:43:59,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:59,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:43:59,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:43:59,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:43:59,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:59,781 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2018-11-28 22:43:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,941 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 22:43:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:43:59,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-28 22:43:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,944 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:43:59,944 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:43:59,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:43:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:43:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:43:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 22:43:59,948 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 16 [2018-11-28 22:43:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,949 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 22:43:59,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:43:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-28 22:43:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:59,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:59,951 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1505749765, now seen corresponding path program 1 times [2018-11-28 22:43:59,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:00,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:00,034 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-28 22:44:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,305 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-28 22:44:00,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:00,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 22:44:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,307 INFO L225 Difference]: With dead ends: 39 [2018-11-28 22:44:00,307 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 22:44:00,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 22:44:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 22:44:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:44:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 22:44:00,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-28 22:44:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,312 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 22:44:00,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 22:44:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:00,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:00,314 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1505749764, now seen corresponding path program 1 times [2018-11-28 22:44:00,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:00,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:00,435 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2018-11-28 22:44:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,595 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-28 22:44:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:00,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-28 22:44:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,601 INFO L225 Difference]: With dead ends: 48 [2018-11-28 22:44:00,601 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 22:44:00,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 22:44:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-11-28 22:44:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 22:44:00,606 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-11-28 22:44:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,606 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 22:44:00,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-28 22:44:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:00,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,607 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] [2018-11-28 22:44:00,608 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,608 INFO L82 PathProgramCache]: Analyzing trace with hash 378404680, now seen corresponding path program 1 times [2018-11-28 22:44:00,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:00,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:00,688 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-28 22:44:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,799 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-28 22:44:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:00,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-28 22:44:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,802 INFO L225 Difference]: With dead ends: 39 [2018-11-28 22:44:00,802 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 22:44:00,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 22:44:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 22:44:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:44:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 22:44:00,806 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2018-11-28 22:44:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,807 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 22:44:00,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 22:44:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:00,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,808 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] [2018-11-28 22:44:00,808 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 378404681, now seen corresponding path program 1 times [2018-11-28 22:44:00,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:01,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:01,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:44:01,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:44:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:44:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:01,038 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2018-11-28 22:44:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:01,617 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-28 22:44:01,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:44:01,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-28 22:44:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:01,619 INFO L225 Difference]: With dead ends: 47 [2018-11-28 22:44:01,620 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 22:44:01,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:44:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 22:44:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-28 22:44:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:44:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 22:44:01,625 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-11-28 22:44:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:01,625 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 22:44:01,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:44:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 22:44:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:01,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:01,626 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] [2018-11-28 22:44:01,626 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:01,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash 378454410, now seen corresponding path program 1 times [2018-11-28 22:44:01,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:01,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:01,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:01,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:44:01,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:44:01,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:44:01,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:01,893 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2018-11-28 22:44:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:02,170 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-28 22:44:02,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:44:02,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-28 22:44:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:02,172 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:44:02,173 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:44:02,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:44:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:44:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-11-28 22:44:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 22:44:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-11-28 22:44:02,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2018-11-28 22:44:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:02,184 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-28 22:44:02,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:44:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-28 22:44:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:02,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:02,186 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] [2018-11-28 22:44:02,186 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:02,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash -632662840, now seen corresponding path program 1 times [2018-11-28 22:44:02,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:02,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:02,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:02,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:02,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:02,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:02,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:02,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:02,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:44:02,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:44:02,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:02,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:02,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:02,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 22:44:03,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 22:44:03,267 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 22 treesize of output 15 [2018-11-28 22:44:03,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:03,295 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 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:44:03,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:03,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:03,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:03,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-28 22:44:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:03,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:44:03,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 19 [2018-11-28 22:44:03,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 22:44:03,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 22:44:03,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:44:03,369 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 19 states. [2018-11-28 22:44:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:05,146 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-11-28 22:44:05,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 22:44:05,147 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2018-11-28 22:44:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:05,149 INFO L225 Difference]: With dead ends: 118 [2018-11-28 22:44:05,149 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 22:44:05,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 22:44:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 22:44:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 65. [2018-11-28 22:44:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 22:44:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-11-28 22:44:05,158 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2018-11-28 22:44:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:05,159 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-11-28 22:44:05,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 22:44:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-28 22:44:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:44:05,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:05,160 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:05,160 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:05,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:05,161 INFO L82 PathProgramCache]: Analyzing trace with hash 616501515, now seen corresponding path program 1 times [2018-11-28 22:44:05,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:05,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:05,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:05,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:05,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:05,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:05,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:05,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:05,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:05,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 22:44:05,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-28 22:44:05,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:05,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:44:06,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-28 22:44:06,064 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 [2018-11-28 22:44:06,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:06,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-11-28 22:44:06,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:06,154 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 19 treesize of output 14 [2018-11-28 22:44:06,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 22:44:06,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:06,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-11-28 22:44:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:06,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:06,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-11-28 22:44:06,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 22:44:06,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 22:44:06,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:44:06,298 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 22 states. [2018-11-28 22:44:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:08,621 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-28 22:44:08,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 22:44:08,622 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-11-28 22:44:08,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:08,624 INFO L225 Difference]: With dead ends: 65 [2018-11-28 22:44:08,624 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 22:44:08,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=128, Invalid=862, Unknown=2, NotChecked=0, Total=992 [2018-11-28 22:44:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 22:44:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 22:44:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 22:44:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-11-28 22:44:08,631 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2018-11-28 22:44:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:08,631 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-11-28 22:44:08,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 22:44:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-28 22:44:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:08,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:08,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:08,632 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:08,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash 246156161, now seen corresponding path program 1 times [2018-11-28 22:44:08,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:08,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:08,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:08,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:08,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:08,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:08,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:08,814 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2018-11-28 22:44:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:08,892 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-28 22:44:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:08,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-28 22:44:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:08,894 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:44:08,894 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 22:44:08,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 22:44:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 22:44:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:44:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-28 22:44:08,899 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 23 [2018-11-28 22:44:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:08,899 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-28 22:44:08,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-28 22:44:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:44:08,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:08,900 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:08,900 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:08,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash -247532276, now seen corresponding path program 1 times [2018-11-28 22:44:08,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:08,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:09,589 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-11-28 22:44:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:09,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:09,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:09,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:09,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:09,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:09,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-11-28 22:44:09,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:44:09,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:44:09,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:09,701 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 10 states. [2018-11-28 22:44:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:09,916 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-28 22:44:09,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:44:09,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 22:44:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:09,924 INFO L225 Difference]: With dead ends: 36 [2018-11-28 22:44:09,924 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 22:44:09,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:44:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 22:44:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 22:44:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 22:44:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-28 22:44:09,926 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2018-11-28 22:44:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:09,927 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-28 22:44:09,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:44:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-28 22:44:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:44:09,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:09,928 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:09,928 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:09,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1655366823, now seen corresponding path program 1 times [2018-11-28 22:44:09,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:09,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:09,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:10,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:10,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:10,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:10,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:10,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:44:10,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2018-11-28 22:44:10,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 22:44:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 22:44:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:44:10,370 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 13 states. [2018-11-28 22:44:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:10,866 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-28 22:44:10,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:44:10,867 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-28 22:44:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:10,868 INFO L225 Difference]: With dead ends: 33 [2018-11-28 22:44:10,868 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 22:44:10,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:44:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 22:44:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 22:44:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 22:44:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-28 22:44:10,873 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-28 22:44:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:10,875 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-28 22:44:10,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 22:44:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-28 22:44:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:44:10,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:10,876 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] [2018-11-28 22:44:10,876 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:10,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1655317094, now seen corresponding path program 1 times [2018-11-28 22:44:10,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:10,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:10,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:11,168 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-11-28 22:44:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:11,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:11,464 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 [2018-11-28 22:44:11,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:11,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:11,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:11,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:11,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:11,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-28 22:44:11,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 22:44:11,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:44:11,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 22:44:11,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-28 22:44:11,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 22:44:11,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:11,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 22:44:12,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-28 22:44:12,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-11-28 22:44:12,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:12,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-11-28 22:44:12,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:12,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:12,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:12,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-11-28 22:44:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:12,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:12,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-11-28 22:44:12,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 22:44:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 22:44:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-11-28 22:44:12,577 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2018-11-28 22:44:13,197 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2018-11-28 22:44:16,761 WARN L180 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2018-11-28 22:44:19,265 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2018-11-28 22:44:19,704 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-11-28 22:44:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:19,951 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-28 22:44:19,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:44:19,952 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-11-28 22:44:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:19,953 INFO L225 Difference]: With dead ends: 30 [2018-11-28 22:44:19,953 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 22:44:19,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 22:44:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 22:44:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-28 22:44:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 22:44:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-28 22:44:19,956 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-28 22:44:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:19,957 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-28 22:44:19,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 22:44:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-28 22:44:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:44:19,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:19,958 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:19,958 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:44:19,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1621829413, now seen corresponding path program 2 times [2018-11-28 22:44:19,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:19,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:19,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:19,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:20,172 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9 [2018-11-28 22:44:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:20,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:20,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:20,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:20,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:20,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:20,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:20,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:20,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:20,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:20,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:20,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:20,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 22:44:20,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 22:44:20,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 22:44:20,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:20,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:20,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:20,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-11-28 22:44:21,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-28 22:44:21,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-11-28 22:44:21,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:21,680 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 29 treesize of output 27 [2018-11-28 22:44:21,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:21,705 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 21 treesize of output 16 [2018-11-28 22:44:21,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 22:44:21,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:21,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-11-28 22:44:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:21,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:21,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-11-28 22:44:21,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 22:44:21,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 22:44:21,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-11-28 22:44:21,892 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-11-28 22:44:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:23,294 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 22:44:23,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 22:44:23,296 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-11-28 22:44:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:23,296 INFO L225 Difference]: With dead ends: 29 [2018-11-28 22:44:23,296 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:44:23,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 22:44:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:44:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:44:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:44:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:44:23,299 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-28 22:44:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:23,299 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:44:23,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 22:44:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:44:23,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:44:23,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:44:23 BoogieIcfgContainer [2018-11-28 22:44:23,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:44:23,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:44:23,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:44:23,305 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:44:23,306 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:56" (3/4) ... [2018-11-28 22:44:23,309 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:44:23,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:44:23,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2018-11-28 22:44:23,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:44:23,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:44:23,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:44:23,323 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-28 22:44:23,324 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 22:44:23,324 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:44:23,385 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:44:23,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:44:23,387 INFO L168 Benchmark]: Toolchain (without parser) took 28131.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -78.4 MB). Peak memory consumption was 222.6 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:23,387 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:23,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:23,392 INFO L168 Benchmark]: Boogie Preprocessor took 90.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:23,396 INFO L168 Benchmark]: RCFGBuilder took 885.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:23,396 INFO L168 Benchmark]: TraceAbstraction took 26390.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.9 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:23,397 INFO L168 Benchmark]: Witness Printer took 80.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:23,403 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 885.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26390.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.9 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. * Witness Printer took 80.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: 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, 51 locations, 15 error locations. SAFE Result, 26.3s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 492 SDtfs, 776 SDslu, 1815 SDs, 0 SdLazy, 2203 SolverSat, 163 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 84 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 487 ConstructedInterpolants, 35 QuantifiedInterpolants, 87381 SizeOfPredicates, 54 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 21/67 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...