./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-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 a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:08:30,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:08:30,169 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:08:30,185 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:08:30,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:08:30,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:08:30,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:08:30,189 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:08:30,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:08:30,191 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:08:30,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:08:30,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:08:30,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:08:30,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:08:30,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:08:30,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:08:30,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:08:30,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:08:30,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:08:30,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:08:30,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:08:30,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:08:30,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:08:30,209 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:08:30,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:08:30,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:08:30,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:08:30,212 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:08:30,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:08:30,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:08:30,214 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:08:30,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:08:30,215 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:08:30,215 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:08:30,216 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:08:30,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:08:30,217 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:08:30,234 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:08:30,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:08:30,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:08:30,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:08:30,236 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:08:30,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:08:30,236 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:08:30,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:08:30,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:08:30,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:08:30,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:08:30,241 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:08:30,241 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:08:30,242 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:08:30,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:08:30,242 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:08:30,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:08:30,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:08:30,243 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:08:30,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:08:30,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:08:30,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:08:30,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:08:30,246 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:08:30,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:08:30,246 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 -> a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 [2019-01-14 18:08:30,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:08:30,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:08:30,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:08:30,314 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:08:30,314 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:08:30,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:30,381 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de006d44/8b683898dfe94fe0bf79fc4eca8d3e62/FLAGdb8064b7e [2019-01-14 18:08:30,880 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:08:30,881 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:30,894 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de006d44/8b683898dfe94fe0bf79fc4eca8d3e62/FLAGdb8064b7e [2019-01-14 18:08:31,193 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de006d44/8b683898dfe94fe0bf79fc4eca8d3e62 [2019-01-14 18:08:31,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:08:31,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:08:31,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:08:31,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:08:31,202 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:08:31,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1021a89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31, skipping insertion in model container [2019-01-14 18:08:31,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:08:31,267 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:08:31,630 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:08:31,649 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:08:31,790 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:08:31,841 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:08:31,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31 WrapperNode [2019-01-14 18:08:31,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:08:31,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:08:31,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:08:31,842 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:08:31,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (1/1) ... [2019-01-14 18:08:31,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:08:31,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:08:31,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:08:31,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:08:31,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:08:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:08:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:08:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:08:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:08:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlen [2019-01-14 18:08:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2019-01-14 18:08:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrstr [2019-01-14 18:08:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:08:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:08:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:08:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:08:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:08:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:08:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:08:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:08:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:08:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:08:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:08:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:08:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:08:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:08:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:08:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:08:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:08:31,981 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:08:31,981 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:08:31,981 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:08:31,981 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:08:31,981 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:08:31,981 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:08:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:08:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:08:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:08:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:08:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:08:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:08:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:08:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:08:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:08:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:08:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:08:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:08:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:08:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:08:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:08:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:08:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:08:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:08:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:08:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:08:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:08:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:08:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:08:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:08:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:08:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:08:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:08:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:08:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:08:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:08:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:08:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:08:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:08:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:08:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:08:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:08:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:08:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:08:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:08:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:08:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:08:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:08:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:08:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:08:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:08:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:08:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:08:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:08:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:08:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:08:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:08:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:08:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:08:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:08:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:08:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:08:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:08:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:08:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:08:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:08:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:08:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:08:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:08:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:08:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:08:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:08:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:08:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:08:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:08:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:08:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:08:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:08:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:08:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlen [2019-01-14 18:08:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:08:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2019-01-14 18:08:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure cstrstr [2019-01-14 18:08:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:08:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:08:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:08:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:08:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:08:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:08:32,829 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:08:32,830 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 18:08:32,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:32 BoogieIcfgContainer [2019-01-14 18:08:32,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:08:32,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:08:32,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:08:32,836 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:08:32,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:08:31" (1/3) ... [2019-01-14 18:08:32,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392e442b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:08:32, skipping insertion in model container [2019-01-14 18:08:32,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:31" (2/3) ... [2019-01-14 18:08:32,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392e442b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:08:32, skipping insertion in model container [2019-01-14 18:08:32,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:32" (3/3) ... [2019-01-14 18:08:32,840 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:32,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:08:32,859 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-01-14 18:08:32,876 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-01-14 18:08:32,902 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:08:32,903 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:08:32,903 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:08:32,904 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:08:32,907 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:08:32,907 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:08:32,907 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:08:32,907 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:08:32,908 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:08:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2019-01-14 18:08:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:08:32,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:32,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:32,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:32,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:32,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1747572420, now seen corresponding path program 1 times [2019-01-14 18:08:32,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:32,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:32,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:32,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:33,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:33,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:08:33,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:08:33,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:08:33,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:33,150 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-01-14 18:08:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:33,550 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-01-14 18:08:33,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:08:33,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:08:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:33,568 INFO L225 Difference]: With dead ends: 80 [2019-01-14 18:08:33,569 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 18:08:33,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 18:08:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 18:08:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 18:08:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-01-14 18:08:33,626 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 10 [2019-01-14 18:08:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:33,627 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-01-14 18:08:33,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:08:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-01-14 18:08:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:08:33,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:33,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:33,628 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:33,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:33,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1747572421, now seen corresponding path program 1 times [2019-01-14 18:08:33,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:33,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:33,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:33,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:33,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:33,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:33,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:33,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:33,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:33,814 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-01-14 18:08:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:33,881 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-01-14 18:08:33,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:33,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:08:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:33,884 INFO L225 Difference]: With dead ends: 76 [2019-01-14 18:08:33,884 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 18:08:33,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 18:08:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-14 18:08:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 18:08:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-01-14 18:08:33,895 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2019-01-14 18:08:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:33,896 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-01-14 18:08:33,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-01-14 18:08:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:08:33,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:33,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:33,897 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1659829787, now seen corresponding path program 1 times [2019-01-14 18:08:33,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:33,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:33,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:33,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:33,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:33,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:33,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:08:33,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:08:33,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:08:33,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:33,950 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2019-01-14 18:08:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:34,021 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-01-14 18:08:34,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:08:34,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 18:08:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:34,023 INFO L225 Difference]: With dead ends: 75 [2019-01-14 18:08:34,023 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 18:08:34,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 18:08:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-14 18:08:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 18:08:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-01-14 18:08:34,032 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 11 [2019-01-14 18:08:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:34,033 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-01-14 18:08:34,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:08:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-01-14 18:08:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:08:34,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:34,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:34,034 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1659829786, now seen corresponding path program 1 times [2019-01-14 18:08:34,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:34,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:34,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:34,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:34,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:34,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:34,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:34,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:34,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:34,120 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2019-01-14 18:08:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:34,166 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-01-14 18:08:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:34,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 18:08:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:34,168 INFO L225 Difference]: With dead ends: 74 [2019-01-14 18:08:34,169 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 18:08:34,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 18:08:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 18:08:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 18:08:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-01-14 18:08:34,177 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 11 [2019-01-14 18:08:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:34,179 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-01-14 18:08:34,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-01-14 18:08:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:08:34,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:34,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:34,180 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash -30588361, now seen corresponding path program 1 times [2019-01-14 18:08:34,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:34,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:34,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:34,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:34,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:34,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:34,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:08:34,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:08:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:08:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:08:34,472 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 5 states. [2019-01-14 18:08:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:34,654 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-01-14 18:08:34,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:08:34,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-14 18:08:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:34,660 INFO L225 Difference]: With dead ends: 73 [2019-01-14 18:08:34,660 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 18:08:34,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 18:08:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-14 18:08:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 18:08:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-01-14 18:08:34,669 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 14 [2019-01-14 18:08:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:34,670 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-01-14 18:08:34,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:08:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-01-14 18:08:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:08:34,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:34,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:34,671 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash -30588360, now seen corresponding path program 1 times [2019-01-14 18:08:34,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:34,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:34,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:34,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:34,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:34,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:34,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:08:34,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:08:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:08:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:08:34,838 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 7 states. [2019-01-14 18:08:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:35,049 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-01-14 18:08:35,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:35,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-14 18:08:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:35,052 INFO L225 Difference]: With dead ends: 72 [2019-01-14 18:08:35,052 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 18:08:35,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 18:08:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-14 18:08:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 18:08:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-01-14 18:08:35,059 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 14 [2019-01-14 18:08:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:35,059 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-01-14 18:08:35,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:08:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-01-14 18:08:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:08:35,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:35,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:35,061 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:35,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:35,061 INFO L82 PathProgramCache]: Analyzing trace with hash -766735103, now seen corresponding path program 1 times [2019-01-14 18:08:35,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:35,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:35,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:35,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:35,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:35,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:35,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:08:35,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:08:35,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:08:35,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:08:35,162 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 7 states. [2019-01-14 18:08:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:35,387 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-01-14 18:08:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:08:35,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-14 18:08:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:35,390 INFO L225 Difference]: With dead ends: 71 [2019-01-14 18:08:35,390 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 18:08:35,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:08:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 18:08:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-14 18:08:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 18:08:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-01-14 18:08:35,397 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 19 [2019-01-14 18:08:35,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:35,397 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-01-14 18:08:35,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:08:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-01-14 18:08:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:08:35,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:35,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:35,399 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash -766735102, now seen corresponding path program 1 times [2019-01-14 18:08:35,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:35,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:35,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:35,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:35,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 18:08:35,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 18:08:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 18:08:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:08:35,869 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 12 states. [2019-01-14 18:08:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:36,552 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-01-14 18:08:36,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:08:36,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-01-14 18:08:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:36,558 INFO L225 Difference]: With dead ends: 80 [2019-01-14 18:08:36,558 INFO L226 Difference]: Without dead ends: 80 [2019-01-14 18:08:36,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:08:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-14 18:08:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2019-01-14 18:08:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 18:08:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-01-14 18:08:36,567 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 19 [2019-01-14 18:08:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:36,567 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-01-14 18:08:36,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 18:08:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-01-14 18:08:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 18:08:36,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:36,569 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] [2019-01-14 18:08:36,570 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:36,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1368651781, now seen corresponding path program 1 times [2019-01-14 18:08:36,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:36,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:36,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:36,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:36,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:36,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:36,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:36,646 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-01-14 18:08:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:36,828 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-01-14 18:08:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:36,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-01-14 18:08:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:36,830 INFO L225 Difference]: With dead ends: 71 [2019-01-14 18:08:36,830 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 18:08:36,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 18:08:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-14 18:08:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 18:08:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-01-14 18:08:36,835 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 21 [2019-01-14 18:08:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:36,835 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-01-14 18:08:36,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-01-14 18:08:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:08:36,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:36,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:36,839 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1169314702, now seen corresponding path program 1 times [2019-01-14 18:08:36,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:36,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:36,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:37,167 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-01-14 18:08:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:37,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:37,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:37,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:37,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:37,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:08:37,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:08:37,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:37,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:37,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:37,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-14 18:08:37,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:08:37,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:08:37,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:37,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:37,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:37,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-14 18:08:38,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 18:08:38,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:08:38,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:38,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:38,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:38,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-14 18:08:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:38,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:38,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-01-14 18:08:38,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 18:08:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 18:08:38,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2019-01-14 18:08:38,361 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 24 states. [2019-01-14 18:08:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:39,587 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-01-14 18:08:39,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 18:08:39,588 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-01-14 18:08:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:39,591 INFO L225 Difference]: With dead ends: 74 [2019-01-14 18:08:39,591 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 18:08:39,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 18:08:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 18:08:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2019-01-14 18:08:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 18:08:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-01-14 18:08:39,598 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2019-01-14 18:08:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:39,599 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-01-14 18:08:39,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 18:08:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-01-14 18:08:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:08:39,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:39,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:39,601 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash 310248900, now seen corresponding path program 1 times [2019-01-14 18:08:39,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:39,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:39,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:39,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:39,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:39,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:39,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:08:39,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:08:39,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:08:39,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:39,692 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2019-01-14 18:08:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:39,819 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-01-14 18:08:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:39,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-14 18:08:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:39,821 INFO L225 Difference]: With dead ends: 62 [2019-01-14 18:08:39,821 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 18:08:39,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 18:08:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-14 18:08:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 18:08:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-01-14 18:08:39,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 27 [2019-01-14 18:08:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:39,828 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-14 18:08:39,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:08:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-01-14 18:08:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:08:39,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:39,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:39,829 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 310248901, now seen corresponding path program 1 times [2019-01-14 18:08:39,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:39,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:39,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:40,098 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2019-01-14 18:08:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:40,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:40,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:08:40,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:08:40,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:08:40,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:40,173 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 8 states. [2019-01-14 18:08:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:40,342 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-01-14 18:08:40,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:08:40,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-14 18:08:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:40,347 INFO L225 Difference]: With dead ends: 67 [2019-01-14 18:08:40,347 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 18:08:40,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:08:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 18:08:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-01-14 18:08:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 18:08:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-01-14 18:08:40,355 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 27 [2019-01-14 18:08:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:40,356 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-01-14 18:08:40,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:08:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-01-14 18:08:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 18:08:40,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:40,361 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:40,361 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:40,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1568641732, now seen corresponding path program 1 times [2019-01-14 18:08:40,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:40,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:40,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:40,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:40,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:40,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:40,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:08:40,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:08:40,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:08:40,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:08:40,679 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 10 states. [2019-01-14 18:08:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:40,929 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2019-01-14 18:08:40,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:08:40,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-14 18:08:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:40,932 INFO L225 Difference]: With dead ends: 81 [2019-01-14 18:08:40,932 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 18:08:40,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:08:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 18:08:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-14 18:08:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 18:08:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-01-14 18:08:40,946 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 32 [2019-01-14 18:08:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:40,946 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-01-14 18:08:40,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:08:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-01-14 18:08:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 18:08:40,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:40,947 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:40,947 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1506602118, now seen corresponding path program 1 times [2019-01-14 18:08:40,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:40,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:40,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:40,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:40,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:41,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:41,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:41,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:41,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:41,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:08:41,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-14 18:08:41,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:08:41,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:08:41,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:41,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-14 18:08:41,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-14 18:08:41,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:08:41,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:41,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-14 18:08:46,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-14 18:08:46,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-14 18:08:46,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:46,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:46,246 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:46,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:46,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:46,341 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-14 18:08:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:46,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:46,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2019-01-14 18:08:46,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 18:08:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 18:08:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=368, Unknown=2, NotChecked=0, Total=420 [2019-01-14 18:08:46,545 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 21 states. [2019-01-14 18:08:47,532 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-01-14 18:08:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:49,874 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-01-14 18:08:49,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:08:49,876 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2019-01-14 18:08:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:49,877 INFO L225 Difference]: With dead ends: 76 [2019-01-14 18:08:49,878 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 18:08:49,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=125, Invalid=743, Unknown=2, NotChecked=0, Total=870 [2019-01-14 18:08:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 18:08:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-01-14 18:08:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 18:08:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-01-14 18:08:49,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 32 [2019-01-14 18:08:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:49,887 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-01-14 18:08:49,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 18:08:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-01-14 18:08:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 18:08:49,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:49,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:49,895 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -438463226, now seen corresponding path program 1 times [2019-01-14 18:08:49,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:49,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:49,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:49,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:50,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:50,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:08:50,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:08:50,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:08:50,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:08:50,126 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 7 states. [2019-01-14 18:08:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:50,386 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2019-01-14 18:08:50,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:08:50,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-01-14 18:08:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:50,388 INFO L225 Difference]: With dead ends: 72 [2019-01-14 18:08:50,388 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 18:08:50,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:08:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 18:08:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-14 18:08:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 18:08:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-01-14 18:08:50,393 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 34 [2019-01-14 18:08:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:50,394 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-01-14 18:08:50,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:08:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-01-14 18:08:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 18:08:50,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:50,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:50,395 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash -438463225, now seen corresponding path program 1 times [2019-01-14 18:08:50,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:50,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:50,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:50,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:50,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:51,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:51,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:08:51,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:08:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:08:51,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:51,059 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 8 states. [2019-01-14 18:08:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:51,146 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-01-14 18:08:51,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:08:51,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-01-14 18:08:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:51,148 INFO L225 Difference]: With dead ends: 107 [2019-01-14 18:08:51,148 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 18:08:51,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:08:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 18:08:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-01-14 18:08:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 18:08:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2019-01-14 18:08:51,156 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 34 [2019-01-14 18:08:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:51,156 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2019-01-14 18:08:51,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:08:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2019-01-14 18:08:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 18:08:51,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:51,160 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:51,160 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2107320667, now seen corresponding path program 1 times [2019-01-14 18:08:51,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:51,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:51,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:08:51,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:51,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 18:08:51,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 18:08:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 18:08:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:08:51,473 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 13 states. [2019-01-14 18:08:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:52,026 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2019-01-14 18:08:52,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:08:52,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-01-14 18:08:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:52,029 INFO L225 Difference]: With dead ends: 146 [2019-01-14 18:08:52,030 INFO L226 Difference]: Without dead ends: 146 [2019-01-14 18:08:52,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:08:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-14 18:08:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2019-01-14 18:08:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 18:08:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2019-01-14 18:08:52,037 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 37 [2019-01-14 18:08:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:52,037 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2019-01-14 18:08:52,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 18:08:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2019-01-14 18:08:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 18:08:52,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:52,041 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:52,041 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:08:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2076747943, now seen corresponding path program 2 times [2019-01-14 18:08:52,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:52,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:52,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:52,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:52,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:52,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:52,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:52,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:08:52,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:08:52,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:08:52,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:52,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:08:52,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:52,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:08:52,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:08:52,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:52,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:52,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:52,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:08:52,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:52,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:08:52,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:52,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:52,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:52,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-14 18:08:52,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 18:08:52,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:08:52,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:52,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:52,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:52,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-14 18:08:53,378 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 34 treesize of output 32 [2019-01-14 18:08:53,382 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 [2019-01-14 18:08:53,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:53,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 18:08:53,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:53,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:53,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:53,437 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-01-14 18:08:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:53,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:53,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-01-14 18:08:53,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 18:08:53,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 18:08:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-01-14 18:08:53,625 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand 24 states. [2019-01-14 18:08:58,023 WARN L181 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-14 18:08:58,683 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-01-14 18:08:58,901 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-01-14 18:09:01,039 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-14 18:09:05,936 WARN L181 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-01-14 18:09:09,989 WARN L181 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-01-14 18:09:12,162 WARN L181 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 18:09:15,674 WARN L181 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-01-14 18:09:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:16,378 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2019-01-14 18:09:16,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 18:09:16,379 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2019-01-14 18:09:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:16,381 INFO L225 Difference]: With dead ends: 144 [2019-01-14 18:09:16,382 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 18:09:16,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 18:09:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 18:09:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2019-01-14 18:09:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 18:09:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2019-01-14 18:09:16,386 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 37 [2019-01-14 18:09:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:16,386 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2019-01-14 18:09:16,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 18:09:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2019-01-14 18:09:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 18:09:16,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:16,388 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:16,389 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:16,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:16,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2089401125, now seen corresponding path program 1 times [2019-01-14 18:09:16,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:16,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:16,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:16,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:09:16,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:09:16,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:16,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:09:16,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:09:16,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:09:16,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:09:16,550 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand 8 states. [2019-01-14 18:09:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:16,698 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-01-14 18:09:16,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:09:16,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-01-14 18:09:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:16,701 INFO L225 Difference]: With dead ends: 89 [2019-01-14 18:09:16,701 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 18:09:16,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:09:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 18:09:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-14 18:09:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 18:09:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2019-01-14 18:09:16,706 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 39 [2019-01-14 18:09:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:16,707 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2019-01-14 18:09:16,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:09:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2019-01-14 18:09:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 18:09:16,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:16,709 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:16,709 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2089401124, now seen corresponding path program 1 times [2019-01-14 18:09:16,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:16,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:16,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:16,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:16,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:17,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:17,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:17,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:17,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:17,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:17,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 15 [2019-01-14 18:09:17,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:09:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:09:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:09:17,254 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 16 states. [2019-01-14 18:09:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:17,612 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2019-01-14 18:09:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:09:17,613 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-01-14 18:09:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:17,615 INFO L225 Difference]: With dead ends: 100 [2019-01-14 18:09:17,615 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 18:09:17,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:09:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 18:09:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2019-01-14 18:09:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 18:09:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2019-01-14 18:09:17,623 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 39 [2019-01-14 18:09:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:17,623 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2019-01-14 18:09:17,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:09:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2019-01-14 18:09:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 18:09:17,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:17,624 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:17,624 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2130216445, now seen corresponding path program 1 times [2019-01-14 18:09:17,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:17,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:09:17,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:17,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:09:17,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:09:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:09:17,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:09:17,811 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand 5 states. [2019-01-14 18:09:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:17,864 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2019-01-14 18:09:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:09:17,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-01-14 18:09:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:17,867 INFO L225 Difference]: With dead ends: 94 [2019-01-14 18:09:17,867 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 18:09:17,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:09:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 18:09:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-01-14 18:09:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 18:09:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-01-14 18:09:17,876 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 41 [2019-01-14 18:09:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:17,876 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-01-14 18:09:17,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:09:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-01-14 18:09:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 18:09:17,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:17,881 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:17,882 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2130216444, now seen corresponding path program 1 times [2019-01-14 18:09:17,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:17,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:17,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:17,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:17,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:09:18,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:18,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:09:18,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:09:18,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:09:18,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:09:18,134 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 8 states. [2019-01-14 18:09:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:18,352 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-01-14 18:09:18,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:09:18,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-01-14 18:09:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:18,357 INFO L225 Difference]: With dead ends: 87 [2019-01-14 18:09:18,357 INFO L226 Difference]: Without dead ends: 87 [2019-01-14 18:09:18,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:09:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-14 18:09:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-14 18:09:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 18:09:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2019-01-14 18:09:18,364 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 41 [2019-01-14 18:09:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:18,364 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2019-01-14 18:09:18,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:09:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2019-01-14 18:09:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 18:09:18,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:18,370 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:18,370 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2136511264, now seen corresponding path program 1 times [2019-01-14 18:09:18,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:18,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:18,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:09:19,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:19,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:19,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:19,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:19,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:09:19,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:09:19,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:09:19,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,144 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:09:19,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:09:19,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:09:19,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-14 18:09:19,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 18:09:19,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:09:19,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:19,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:09:19,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-14 18:09:21,044 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 [2019-01-14 18:09:21,054 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 [2019-01-14 18:09:21,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:09:21,066 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 [2019-01-14 18:09:21,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:21,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:21,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:21,082 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2019-01-14 18:09:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:09:21,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:21,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 25 [2019-01-14 18:09:21,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 18:09:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 18:09:21,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=575, Unknown=1, NotChecked=0, Total=650 [2019-01-14 18:09:21,210 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand 26 states. [2019-01-14 18:09:23,824 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-01-14 18:09:24,050 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-01-14 18:09:26,213 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-01-14 18:09:28,067 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-01-14 18:09:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:28,702 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2019-01-14 18:09:28,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 18:09:28,704 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-01-14 18:09:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:28,705 INFO L225 Difference]: With dead ends: 107 [2019-01-14 18:09:28,705 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 18:09:28,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=243, Invalid=1395, Unknown=2, NotChecked=0, Total=1640 [2019-01-14 18:09:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 18:09:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2019-01-14 18:09:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 18:09:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2019-01-14 18:09:28,709 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 42 [2019-01-14 18:09:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:28,709 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2019-01-14 18:09:28,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 18:09:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2019-01-14 18:09:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 18:09:28,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:28,710 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:28,710 INFO L423 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1561671395, now seen corresponding path program 1 times [2019-01-14 18:09:28,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:28,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:28,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:09:28,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:28,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:09:28,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:09:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:09:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:09:28,802 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 8 states. [2019-01-14 18:09:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:28,923 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-01-14 18:09:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:09:28,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-01-14 18:09:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:28,925 INFO L225 Difference]: With dead ends: 59 [2019-01-14 18:09:28,925 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 18:09:28,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:09:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 18:09:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-14 18:09:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 18:09:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-01-14 18:09:28,928 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 43 [2019-01-14 18:09:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:28,928 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-01-14 18:09:28,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:09:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-01-14 18:09:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 18:09:28,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:28,929 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:28,929 INFO L423 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1561671394, now seen corresponding path program 1 times [2019-01-14 18:09:28,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:28,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:28,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:28,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:29,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:29,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:29,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:29,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:29,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:29,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2019-01-14 18:09:29,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:09:29,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:09:29,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:09:29,424 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 17 states. [2019-01-14 18:09:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:29,846 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2019-01-14 18:09:29,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:09:29,847 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-01-14 18:09:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:29,849 INFO L225 Difference]: With dead ends: 78 [2019-01-14 18:09:29,849 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 18:09:29,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-01-14 18:09:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 18:09:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2019-01-14 18:09:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 18:09:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-01-14 18:09:29,853 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 43 [2019-01-14 18:09:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:29,853 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-01-14 18:09:29,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:09:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-01-14 18:09:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 18:09:29,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:29,854 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:29,854 INFO L423 AbstractCegarLoop]: === Iteration 26 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:29,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:29,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1556246018, now seen corresponding path program 1 times [2019-01-14 18:09:29,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:29,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:29,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:29,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:29,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:30,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:30,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:30,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:30,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:30,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:09:30,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:09:30,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:09:30,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,600 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,610 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:09:30,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:09:30,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:09:30,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-14 18:09:30,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 18:09:30,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:09:30,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:30,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:09:30,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-14 18:09:33,357 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-01-14 18:09:33,756 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 46 treesize of output 40 [2019-01-14 18:09:33,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:09:33,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:09:33,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 18:09:33,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:33,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:33,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:33,830 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-14 18:09:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:33,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:33,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2019-01-14 18:09:33,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 18:09:33,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 18:09:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=684, Unknown=1, NotChecked=0, Total=756 [2019-01-14 18:09:33,944 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 28 states. [2019-01-14 18:09:37,828 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-14 18:09:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:38,997 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2019-01-14 18:09:38,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 18:09:38,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-01-14 18:09:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:38,999 INFO L225 Difference]: With dead ends: 127 [2019-01-14 18:09:39,000 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 18:09:39,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=330, Invalid=3091, Unknown=1, NotChecked=0, Total=3422 [2019-01-14 18:09:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 18:09:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-01-14 18:09:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 18:09:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-01-14 18:09:39,004 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 45 [2019-01-14 18:09:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:39,004 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-01-14 18:09:39,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 18:09:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-01-14 18:09:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 18:09:39,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:39,007 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:39,008 INFO L423 AbstractCegarLoop]: === Iteration 27 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1025891093, now seen corresponding path program 1 times [2019-01-14 18:09:39,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:39,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:39,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:39,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:39,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:39,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:39,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:39,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:39,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:39,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:39,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-01-14 18:09:39,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 18:09:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 18:09:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-01-14 18:09:39,706 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 21 states. [2019-01-14 18:09:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:40,252 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2019-01-14 18:09:40,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 18:09:40,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-01-14 18:09:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:40,255 INFO L225 Difference]: With dead ends: 82 [2019-01-14 18:09:40,255 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 18:09:40,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-01-14 18:09:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 18:09:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2019-01-14 18:09:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 18:09:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-01-14 18:09:40,259 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 50 [2019-01-14 18:09:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:40,259 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-01-14 18:09:40,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 18:09:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-01-14 18:09:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 18:09:40,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:40,260 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:40,260 INFO L423 AbstractCegarLoop]: === Iteration 28 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash -835581523, now seen corresponding path program 1 times [2019-01-14 18:09:40,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:40,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:40,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:40,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:40,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:40,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:40,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:40,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:40,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:40,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 18 [2019-01-14 18:09:40,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-14 18:09:40,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 18:09:40,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:09:40,853 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 19 states. [2019-01-14 18:09:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:42,522 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-01-14 18:09:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 18:09:42,523 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-01-14 18:09:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:42,524 INFO L225 Difference]: With dead ends: 96 [2019-01-14 18:09:42,525 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 18:09:42,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-01-14 18:09:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 18:09:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2019-01-14 18:09:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 18:09:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-01-14 18:09:42,528 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 54 [2019-01-14 18:09:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:42,528 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-01-14 18:09:42,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-14 18:09:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-01-14 18:09:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 18:09:42,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:42,531 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:42,532 INFO L423 AbstractCegarLoop]: === Iteration 29 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 431418061, now seen corresponding path program 2 times [2019-01-14 18:09:42,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:42,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:42,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:42,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:42,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:42,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:09:42,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:09:42,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:09:42,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:43,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:09:43,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:09:43,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:09:43,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,474 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-01-14 18:09:43,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:09:43,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:09:43,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-01-14 18:09:43,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 18:09:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:09:43,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:43,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-01-14 18:09:45,361 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 46 treesize of output 40 [2019-01-14 18:09:45,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-14 18:09:45,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:45,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:09:45,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:09:45,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:45,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 18:09:45,428 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2019-01-14 18:09:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:45,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:45,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23] total 34 [2019-01-14 18:09:45,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 18:09:45,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 18:09:45,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 18:09:45,649 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 34 states. [2019-01-14 18:09:48,283 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-01-14 18:09:48,860 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 18:09:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:49,029 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2019-01-14 18:09:49,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 18:09:49,030 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 56 [2019-01-14 18:09:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:49,032 INFO L225 Difference]: With dead ends: 135 [2019-01-14 18:09:49,033 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 18:09:49,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=261, Invalid=2709, Unknown=0, NotChecked=0, Total=2970 [2019-01-14 18:09:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 18:09:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-14 18:09:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 18:09:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-01-14 18:09:49,037 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 56 [2019-01-14 18:09:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:49,038 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-01-14 18:09:49,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 18:09:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-01-14 18:09:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 18:09:49,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:49,039 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:49,039 INFO L423 AbstractCegarLoop]: === Iteration 30 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:49,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1701591007, now seen corresponding path program 3 times [2019-01-14 18:09:49,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:49,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:49,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:09:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:49,352 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-01-14 18:09:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:09:50,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:50,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:50,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 18:09:50,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 18:09:50,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:09:50,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:50,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:09:50,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:09:50,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:09:50,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,171 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-01-14 18:09:50,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:09:50,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:09:50,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2019-01-14 18:09:50,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 18:09:50,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:09:50,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:50,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:09:50,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-01-14 18:09:51,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-14 18:09:51,013 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 9 treesize of output 1 [2019-01-14 18:09:51,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:51,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:09:51,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:09:51,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:51,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:51,045 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-14 18:09:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 18:09:51,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:51,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 38 [2019-01-14 18:09:51,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-14 18:09:51,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-14 18:09:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1385, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 18:09:51,175 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 39 states. [2019-01-14 18:09:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:54,657 INFO L93 Difference]: Finished difference Result 154 states and 177 transitions. [2019-01-14 18:09:54,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 18:09:54,659 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 59 [2019-01-14 18:09:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:54,660 INFO L225 Difference]: With dead ends: 154 [2019-01-14 18:09:54,660 INFO L226 Difference]: Without dead ends: 154 [2019-01-14 18:09:54,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=285, Invalid=3497, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 18:09:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-14 18:09:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2019-01-14 18:09:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 18:09:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2019-01-14 18:09:54,667 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 59 [2019-01-14 18:09:54,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:54,667 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2019-01-14 18:09:54,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-14 18:09:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2019-01-14 18:09:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 18:09:54,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:54,672 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:54,672 INFO L423 AbstractCegarLoop]: === Iteration 31 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1153583650, now seen corresponding path program 2 times [2019-01-14 18:09:54,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:54,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:54,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:54,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:09:54,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:55,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:55,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:55,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:09:55,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:09:55,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:09:55,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:09:55,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:55,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2019-01-14 18:09:55,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 18:09:55,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 18:09:55,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2019-01-14 18:09:55,563 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand 28 states. [2019-01-14 18:09:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:56,484 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2019-01-14 18:09:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 18:09:56,486 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-01-14 18:09:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:56,488 INFO L225 Difference]: With dead ends: 197 [2019-01-14 18:09:56,489 INFO L226 Difference]: Without dead ends: 197 [2019-01-14 18:09:56,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 18:09:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-14 18:09:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2019-01-14 18:09:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 18:09:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 182 transitions. [2019-01-14 18:09:56,501 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 182 transitions. Word has length 61 [2019-01-14 18:09:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:56,501 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 182 transitions. [2019-01-14 18:09:56,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 18:09:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2019-01-14 18:09:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 18:09:56,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:56,503 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:56,507 INFO L423 AbstractCegarLoop]: === Iteration 32 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:09:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash -165341466, now seen corresponding path program 1 times [2019-01-14 18:09:56,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:56,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:09:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 18:09:57,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:57,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:57,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:57,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:57,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:09:57,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:09:57,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:09:57,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:09:57,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:09:57,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:09:57,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-14 18:09:57,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 18:09:57,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:09:57,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:57,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:09:57,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-14 18:09:58,589 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 46 treesize of output 40 [2019-01-14 18:09:58,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:09:58,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:09:58,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 18:09:58,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:58,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:58,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:58,646 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-14 18:09:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 18:09:58,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:58,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2019-01-14 18:09:58,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 18:09:58,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 18:09:58,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1745, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 18:09:58,797 INFO L87 Difference]: Start difference. First operand 146 states and 182 transitions. Second operand 44 states. [2019-01-14 18:10:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:04,809 INFO L93 Difference]: Finished difference Result 195 states and 227 transitions. [2019-01-14 18:10:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 18:10:04,812 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 64 [2019-01-14 18:10:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:04,815 INFO L225 Difference]: With dead ends: 195 [2019-01-14 18:10:04,816 INFO L226 Difference]: Without dead ends: 195 [2019-01-14 18:10:04,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=449, Invalid=4953, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 18:10:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-14 18:10:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 92. [2019-01-14 18:10:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 18:10:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-01-14 18:10:04,825 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 64 [2019-01-14 18:10:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:04,829 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-01-14 18:10:04,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 18:10:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-01-14 18:10:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 18:10:04,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:04,830 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:04,831 INFO L423 AbstractCegarLoop]: === Iteration 33 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:10:04,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:04,831 INFO L82 PathProgramCache]: Analyzing trace with hash 679918436, now seen corresponding path program 2 times [2019-01-14 18:10:04,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:04,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:04,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:04,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:04,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:10:05,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:05,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:10:05,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:10:05,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 18:10:05,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:10:05,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-14 18:10:05,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 18:10:05,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 21 [2019-01-14 18:10:05,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 18:10:05,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 18:10:05,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:10:05,943 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 22 states. [2019-01-14 18:10:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:06,853 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-01-14 18:10:06,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 18:10:06,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2019-01-14 18:10:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:06,856 INFO L225 Difference]: With dead ends: 116 [2019-01-14 18:10:06,856 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 18:10:06,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 18:10:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 18:10:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2019-01-14 18:10:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 18:10:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2019-01-14 18:10:06,860 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 65 [2019-01-14 18:10:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:06,861 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2019-01-14 18:10:06,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 18:10:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2019-01-14 18:10:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 18:10:06,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:06,862 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:06,862 INFO L423 AbstractCegarLoop]: === Iteration 34 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:10:06,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash 832965316, now seen corresponding path program 4 times [2019-01-14 18:10:06,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:06,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:06,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:06,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:10:06,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:10:07,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:07,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:10:07,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 18:10:07,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 18:10:07,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:10:07,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:07,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:10:07,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:10:07,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:10:07,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,434 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:10:07,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:10:07,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:10:07,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-14 18:10:07,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 18:10:07,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:10:07,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:07,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:10:07,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-14 18:10:11,043 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 46 treesize of output 40 [2019-01-14 18:10:11,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:10:11,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:10:11,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 18:10:11,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:11,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:10:11,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:10:11,105 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-14 18:10:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:10:11,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:11,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 38 [2019-01-14 18:10:11,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 18:10:11,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 18:10:11,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 18:10:11,258 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand 38 states. [2019-01-14 18:10:19,865 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-01-14 18:10:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:21,243 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2019-01-14 18:10:21,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-14 18:10:21,244 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 67 [2019-01-14 18:10:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:21,246 INFO L225 Difference]: With dead ends: 195 [2019-01-14 18:10:21,246 INFO L226 Difference]: Without dead ends: 119 [2019-01-14 18:10:21,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=460, Invalid=6020, Unknown=0, NotChecked=0, Total=6480 [2019-01-14 18:10:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-14 18:10:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-14 18:10:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 18:10:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-01-14 18:10:21,251 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 67 [2019-01-14 18:10:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:21,252 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-01-14 18:10:21,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 18:10:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-01-14 18:10:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 18:10:21,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:21,253 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:21,253 INFO L423 AbstractCegarLoop]: === Iteration 35 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:10:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:21,253 INFO L82 PathProgramCache]: Analyzing trace with hash 330781843, now seen corresponding path program 5 times [2019-01-14 18:10:21,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:21,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:21,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:10:21,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:10:21,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:21,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:10:21,655 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 18:10:33,915 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-01-14 18:10:33,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:10:33,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:33,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:10:33,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:33,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:10:33,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:10:33,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:33,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:33,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:33,990 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:10:34,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:10:34,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:10:34,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:34,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:34,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:34,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 18:10:34,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 18:10:34,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:10:34,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:34,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:34,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:10:34,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-01-14 18:10:43,726 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 [2019-01-14 18:10:43,747 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 [2019-01-14 18:10:43,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:10:43,758 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 [2019-01-14 18:10:43,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:43,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:10:43,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:10:43,806 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2019-01-14 18:10:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 18:10:43,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:43,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2019-01-14 18:10:43,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 18:10:43,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 18:10:43,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=849, Unknown=3, NotChecked=0, Total=930 [2019-01-14 18:10:43,943 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 31 states. [2019-01-14 18:10:46,954 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-14 18:10:50,940 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 18:10:53,360 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-14 18:10:57,588 WARN L181 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-14 18:10:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:57,918 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2019-01-14 18:10:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-14 18:10:57,920 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2019-01-14 18:10:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:57,922 INFO L225 Difference]: With dead ends: 212 [2019-01-14 18:10:57,922 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 18:10:57,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=415, Invalid=3614, Unknown=3, NotChecked=0, Total=4032 [2019-01-14 18:10:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 18:10:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2019-01-14 18:10:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 18:10:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2019-01-14 18:10:57,927 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 78 [2019-01-14 18:10:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:57,927 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2019-01-14 18:10:57,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 18:10:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2019-01-14 18:10:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 18:10:57,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:57,928 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:57,928 INFO L423 AbstractCegarLoop]: === Iteration 36 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION]=== [2019-01-14 18:10:57,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:57,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1033657496, now seen corresponding path program 3 times [2019-01-14 18:10:57,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:57,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:57,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:10:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:10:58,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:58,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:10:58,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 18:10:58,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 18:10:58,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:10:58,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:58,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:10:58,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:10:58,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:10:58,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:10:58,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:58,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-14 18:10:58,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:10:58,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:10:58,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:58,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:58,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:58,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-14 18:10:59,334 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 32 treesize of output 32 [2019-01-14 18:10:59,337 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 28 treesize of output 21 [2019-01-14 18:10:59,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:59,382 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 24 treesize of output 27 [2019-01-14 18:10:59,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:10:59,406 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 21 treesize of output 19 [2019-01-14 18:10:59,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 18:10:59,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:10:59,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:10:59,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-01-14 18:10:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-14 18:10:59,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:59,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2019-01-14 18:10:59,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 18:10:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 18:10:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 18:10:59,600 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 33 states. [2019-01-14 18:11:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:11:03,037 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2019-01-14 18:11:03,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-14 18:11:03,039 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 83 [2019-01-14 18:11:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:11:03,040 INFO L225 Difference]: With dead ends: 144 [2019-01-14 18:11:03,040 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:11:03,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=775, Invalid=5231, Unknown=0, NotChecked=0, Total=6006 [2019-01-14 18:11:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:11:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:11:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:11:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:11:03,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-01-14 18:11:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:11:03,043 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:11:03,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 18:11:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:11:03,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:11:03,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:11:03 BoogieIcfgContainer [2019-01-14 18:11:03,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:11:03,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:11:03,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:11:03,050 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:11:03,050 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:32" (3/4) ... [2019-01-14 18:11:03,054 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:11:03,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:11:03,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:11:03,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:11:03,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlen [2019-01-14 18:11:03,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:11:03,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2019-01-14 18:11:03,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrstr [2019-01-14 18:11:03,067 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-14 18:11:03,068 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 18:11:03,068 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 18:11:03,108 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:11:03,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:11:03,109 INFO L168 Benchmark]: Toolchain (without parser) took 151912.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 951.4 MB in the beginning and 854.9 MB in the end (delta: 96.4 MB). Peak memory consumption was 391.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:11:03,110 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:11:03,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-14 18:11:03,110 INFO L168 Benchmark]: Boogie Preprocessor took 74.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:11:03,110 INFO L168 Benchmark]: RCFGBuilder took 914.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-14 18:11:03,111 INFO L168 Benchmark]: TraceAbstraction took 150216.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.8 MB). Free memory was 1.1 GB in the beginning and 855.0 MB in the end (delta: 214.5 MB). Peak memory consumption was 361.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:11:03,111 INFO L168 Benchmark]: Witness Printer took 58.84 ms. Allocated memory is still 1.3 GB. Free memory was 855.0 MB in the beginning and 854.9 MB in the end (delta: 42.3 kB). Peak memory consumption was 42.3 kB. Max. memory is 11.5 GB. [2019-01-14 18:11:03,113 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 914.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 150216.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.8 MB). Free memory was 1.1 GB in the beginning and 855.0 MB in the end (delta: 214.5 MB). Peak memory consumption was 361.3 MB. Max. memory is 11.5 GB. * Witness Printer took 58.84 ms. Allocated memory is still 1.3 GB. Free memory was 855.0 MB in the beginning and 854.9 MB in the end (delta: 42.3 kB). Peak memory consumption was 42.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: 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: 578]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 87 locations, 21 error locations. SAFE Result, 150.1s OverallTime, 36 OverallIterations, 6 TraceHistogramMax, 89.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2189 SDtfs, 4221 SDslu, 19606 SDs, 0 SdLazy, 16854 SolverSat, 1110 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 36.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1655 GetRequests, 738 SyntacticMatches, 17 SemanticMatches, 900 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7856 ImplicationChecksByTransitivity, 90.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=31, 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.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 457 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 13.3s SatisfiabilityAnalysisTime, 45.9s InterpolantComputationTime, 2278 NumberOfCodeBlocks, 2242 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2225 ConstructedInterpolants, 360 QuantifiedInterpolants, 1455129 SizeOfPredicates, 311 NumberOfNonLiveVariables, 4310 ConjunctsInSsa, 1012 ConjunctsInUnsatCore, 53 InterpolantComputations, 20 PerfectInterpolantSequences, 287/810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...