./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer --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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:25:49,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:25:49,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:25:49,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:25:49,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:25:49,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:25:49,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:25:49,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:25:49,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:25:49,217 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:25:49,218 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:25:49,218 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:25:49,219 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:25:49,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:25:49,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:25:49,221 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:25:49,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:25:49,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:25:49,224 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:25:49,225 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:25:49,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:25:49,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:25:49,228 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:25:49,228 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:25:49,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:25:49,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:25:49,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:25:49,230 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:25:49,231 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:25:49,232 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:25:49,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:25:49,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:25:49,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:25:49,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:25:49,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:25:49,234 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:25:49,234 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 13:25:49,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:25:49,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:25:49,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:25:49,245 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:25:49,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:25:49,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:25:49,245 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:25:49,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:25:49,246 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:25:49,246 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:25:49,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:25:49,247 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:25:49,247 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:25:49,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:25:49,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:25:49,247 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:25:49,247 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:25:49,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:25:49,247 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer 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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-11-28 13:25:49,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:25:49,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:25:49,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:25:49,282 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:25:49,282 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:25:49,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 13:25:49,320 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/data/31a4f13e6/34c7082f1e0349ab95b0d301f0fc7e04/FLAGc770b0a7b [2018-11-28 13:25:49,667 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:25:49,667 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 13:25:49,676 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/data/31a4f13e6/34c7082f1e0349ab95b0d301f0fc7e04/FLAGc770b0a7b [2018-11-28 13:25:49,687 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/data/31a4f13e6/34c7082f1e0349ab95b0d301f0fc7e04 [2018-11-28 13:25:49,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:25:49,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:25:49,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:25:49,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:25:49,693 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:25:49,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:25:49" (1/1) ... [2018-11-28 13:25:49,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6075b3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:49, skipping insertion in model container [2018-11-28 13:25:49,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:25:49" (1/1) ... [2018-11-28 13:25:49,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:25:49,725 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:25:49,911 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:25:49,918 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:25:49,992 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:25:50,025 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:25:50,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50 WrapperNode [2018-11-28 13:25:50,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:25:50,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:25:50,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:25:50,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:25:50,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (1/1) ... [2018-11-28 13:25:50,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (1/1) ... [2018-11-28 13:25:50,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (1/1) ... [2018-11-28 13:25:50,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (1/1) ... [2018-11-28 13:25:50,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (1/1) ... [2018-11-28 13:25:50,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (1/1) ... [2018-11-28 13:25:50,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (1/1) ... [2018-11-28 13:25:50,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:25:50,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:25:50,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:25:50,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:25:50,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:25:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:25:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:25:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:25:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:25:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:25:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:25:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:25:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:25:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:25:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:25:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:25:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:25:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:25:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:25:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:25:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:25:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:25:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:25:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:25:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:25:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:25:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:25:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:25:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:25:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:25:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:25:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:25:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:25:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:25:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:25:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:25:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:25:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:25:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:25:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:25:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:25:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:25:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:25:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:25:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:25:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:25:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:25:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:25:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:25:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:25:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:25:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:25:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:25:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:25:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:25:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:25:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:25:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:25:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:25:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:25:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:25:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:25:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:25:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:25:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:25:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:25:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:25:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:25:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:25:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:25:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 13:25:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 13:25:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:25:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:25:50,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:25:50,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:25:50,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:25:50,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:25:50,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:25:50,645 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:25:50,645 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-11-28 13:25:50,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:25:50 BoogieIcfgContainer [2018-11-28 13:25:50,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:25:50,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:25:50,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:25:50,648 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:25:50,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:25:49" (1/3) ... [2018-11-28 13:25:50,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1254843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:25:50, skipping insertion in model container [2018-11-28 13:25:50,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:25:50" (2/3) ... [2018-11-28 13:25:50,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1254843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:25:50, skipping insertion in model container [2018-11-28 13:25:50,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:25:50" (3/3) ... [2018-11-28 13:25:50,650 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 13:25:50,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:25:50,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-28 13:25:50,675 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-28 13:25:50,691 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:25:50,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:25:50,691 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:25:50,691 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:25:50,691 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:25:50,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:25:50,692 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:25:50,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:25:50,692 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:25:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2018-11-28 13:25:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 13:25:50,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:50,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:50,715 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:50,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:50,719 INFO L82 PathProgramCache]: Analyzing trace with hash -184166559, now seen corresponding path program 1 times [2018-11-28 13:25:50,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:50,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:50,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:50,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:50,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:50,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:25:50,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:25:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:25:50,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:25:50,853 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 3 states. [2018-11-28 13:25:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:51,018 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-11-28 13:25:51,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:25:51,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 13:25:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:51,026 INFO L225 Difference]: With dead ends: 168 [2018-11-28 13:25:51,027 INFO L226 Difference]: Without dead ends: 164 [2018-11-28 13:25:51,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:25:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-28 13:25:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2018-11-28 13:25:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-28 13:25:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-11-28 13:25:51,060 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 7 [2018-11-28 13:25:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:51,061 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-11-28 13:25:51,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:25:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-11-28 13:25:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 13:25:51,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:51,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:51,062 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:51,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash -184166558, now seen corresponding path program 1 times [2018-11-28 13:25:51,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:51,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:51,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:51,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:51,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:51,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:51,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:25:51,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:25:51,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:25:51,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:25:51,106 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 3 states. [2018-11-28 13:25:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:51,293 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2018-11-28 13:25:51,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:25:51,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 13:25:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:51,295 INFO L225 Difference]: With dead ends: 179 [2018-11-28 13:25:51,295 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 13:25:51,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:25:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 13:25:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 168. [2018-11-28 13:25:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-28 13:25:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-11-28 13:25:51,305 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 7 [2018-11-28 13:25:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:51,305 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-11-28 13:25:51,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:25:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-11-28 13:25:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:25:51,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:51,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:51,306 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:51,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash 712155735, now seen corresponding path program 1 times [2018-11-28 13:25:51,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:51,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:51,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:51,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:51,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:25:51,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:25:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:25:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:25:51,356 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2018-11-28 13:25:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:51,607 INFO L93 Difference]: Finished difference Result 288 states and 317 transitions. [2018-11-28 13:25:51,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:25:51,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 13:25:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:51,608 INFO L225 Difference]: With dead ends: 288 [2018-11-28 13:25:51,608 INFO L226 Difference]: Without dead ends: 288 [2018-11-28 13:25:51,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-28 13:25:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 167. [2018-11-28 13:25:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-28 13:25:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-28 13:25:51,617 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 14 [2018-11-28 13:25:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:51,617 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-28 13:25:51,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:25:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-28 13:25:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:25:51,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:51,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:51,618 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:51,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash 712155736, now seen corresponding path program 1 times [2018-11-28 13:25:51,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:51,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:51,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:51,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:51,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:25:51,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:25:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:25:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:25:51,679 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 5 states. [2018-11-28 13:25:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:51,889 INFO L93 Difference]: Finished difference Result 311 states and 350 transitions. [2018-11-28 13:25:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:25:51,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 13:25:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:51,890 INFO L225 Difference]: With dead ends: 311 [2018-11-28 13:25:51,890 INFO L226 Difference]: Without dead ends: 311 [2018-11-28 13:25:51,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-28 13:25:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 166. [2018-11-28 13:25:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-28 13:25:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2018-11-28 13:25:51,899 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 14 [2018-11-28 13:25:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:51,899 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2018-11-28 13:25:51,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:25:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2018-11-28 13:25:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 13:25:51,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:51,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:51,900 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:51,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:51,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1306930890, now seen corresponding path program 1 times [2018-11-28 13:25:51,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:51,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:51,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:51,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:51,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:51,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:51,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:25:51,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:25:51,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:25:51,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:51,979 INFO L87 Difference]: Start difference. First operand 166 states and 186 transitions. Second operand 8 states. [2018-11-28 13:25:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:52,414 INFO L93 Difference]: Finished difference Result 290 states and 317 transitions. [2018-11-28 13:25:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:25:52,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-28 13:25:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:52,416 INFO L225 Difference]: With dead ends: 290 [2018-11-28 13:25:52,416 INFO L226 Difference]: Without dead ends: 290 [2018-11-28 13:25:52,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:25:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-28 13:25:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 165. [2018-11-28 13:25:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-28 13:25:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-11-28 13:25:52,422 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 17 [2018-11-28 13:25:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:52,422 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-11-28 13:25:52,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:25:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-11-28 13:25:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 13:25:52,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:52,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:52,423 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:52,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1306930889, now seen corresponding path program 1 times [2018-11-28 13:25:52,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:52,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:52,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:52,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:52,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:52,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:52,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:25:52,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:25:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:25:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:52,521 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 8 states. [2018-11-28 13:25:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:53,177 INFO L93 Difference]: Finished difference Result 291 states and 318 transitions. [2018-11-28 13:25:53,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:25:53,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-28 13:25:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:53,179 INFO L225 Difference]: With dead ends: 291 [2018-11-28 13:25:53,179 INFO L226 Difference]: Without dead ends: 291 [2018-11-28 13:25:53,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:25:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-28 13:25:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 164. [2018-11-28 13:25:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-28 13:25:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2018-11-28 13:25:53,184 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 17 [2018-11-28 13:25:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:53,185 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2018-11-28 13:25:53,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:25:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2018-11-28 13:25:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 13:25:53,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:53,185 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] [2018-11-28 13:25:53,186 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:53,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1193006862, now seen corresponding path program 1 times [2018-11-28 13:25:53,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:53,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:53,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:53,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:25:53,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:25:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:25:53,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:25:53,239 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand 5 states. [2018-11-28 13:25:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:53,350 INFO L93 Difference]: Finished difference Result 243 states and 269 transitions. [2018-11-28 13:25:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:25:53,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-28 13:25:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:53,351 INFO L225 Difference]: With dead ends: 243 [2018-11-28 13:25:53,351 INFO L226 Difference]: Without dead ends: 243 [2018-11-28 13:25:53,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:25:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-28 13:25:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 167. [2018-11-28 13:25:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-28 13:25:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-28 13:25:53,355 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 21 [2018-11-28 13:25:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:53,356 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-28 13:25:53,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:25:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-28 13:25:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:25:53,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:53,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:53,357 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:53,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1345659283, now seen corresponding path program 1 times [2018-11-28 13:25:53,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:53,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:53,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:53,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:25:53,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:25:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:25:53,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:25:53,390 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 4 states. [2018-11-28 13:25:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:53,470 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2018-11-28 13:25:53,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:25:53,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-28 13:25:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:53,471 INFO L225 Difference]: With dead ends: 169 [2018-11-28 13:25:53,471 INFO L226 Difference]: Without dead ends: 169 [2018-11-28 13:25:53,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:25:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-28 13:25:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2018-11-28 13:25:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-28 13:25:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2018-11-28 13:25:53,474 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 23 [2018-11-28 13:25:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:53,474 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2018-11-28 13:25:53,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:25:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2018-11-28 13:25:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:25:53,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:53,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:53,476 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:53,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:53,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1345659284, now seen corresponding path program 1 times [2018-11-28 13:25:53,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:53,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:53,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:53,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:25:53,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:25:53,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:25:53,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:25:53,536 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 6 states. [2018-11-28 13:25:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:53,703 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-28 13:25:53,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:25:53,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 13:25:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:53,704 INFO L225 Difference]: With dead ends: 207 [2018-11-28 13:25:53,704 INFO L226 Difference]: Without dead ends: 207 [2018-11-28 13:25:53,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:25:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-28 13:25:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2018-11-28 13:25:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-28 13:25:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2018-11-28 13:25:53,706 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 23 [2018-11-28 13:25:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:53,707 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2018-11-28 13:25:53,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:25:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2018-11-28 13:25:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 13:25:53,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:53,707 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] [2018-11-28 13:25:53,708 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:53,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash -688979348, now seen corresponding path program 1 times [2018-11-28 13:25:53,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:53,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:53,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:53,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:25:53,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:25:53,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:25:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:25:53,750 INFO L87 Difference]: Start difference. First operand 181 states and 212 transitions. Second operand 6 states. [2018-11-28 13:25:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:53,945 INFO L93 Difference]: Finished difference Result 262 states and 310 transitions. [2018-11-28 13:25:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:25:53,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 13:25:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:53,947 INFO L225 Difference]: With dead ends: 262 [2018-11-28 13:25:53,947 INFO L226 Difference]: Without dead ends: 262 [2018-11-28 13:25:53,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:25:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-28 13:25:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 180. [2018-11-28 13:25:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-28 13:25:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 211 transitions. [2018-11-28 13:25:53,952 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 211 transitions. Word has length 26 [2018-11-28 13:25:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:53,952 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 211 transitions. [2018-11-28 13:25:53,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:25:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 211 transitions. [2018-11-28 13:25:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 13:25:53,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:53,953 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] [2018-11-28 13:25:53,954 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:53,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash -688979347, now seen corresponding path program 1 times [2018-11-28 13:25:53,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:53,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:53,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:53,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:54,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:54,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:25:54,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:25:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:25:54,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:25:54,019 INFO L87 Difference]: Start difference. First operand 180 states and 211 transitions. Second operand 6 states. [2018-11-28 13:25:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:54,218 INFO L93 Difference]: Finished difference Result 278 states and 334 transitions. [2018-11-28 13:25:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:25:54,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 13:25:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:54,219 INFO L225 Difference]: With dead ends: 278 [2018-11-28 13:25:54,219 INFO L226 Difference]: Without dead ends: 278 [2018-11-28 13:25:54,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:25:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-28 13:25:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 167. [2018-11-28 13:25:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-28 13:25:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2018-11-28 13:25:54,224 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 26 [2018-11-28 13:25:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:54,224 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2018-11-28 13:25:54,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:25:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2018-11-28 13:25:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 13:25:54,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:54,225 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] [2018-11-28 13:25:54,225 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:54,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1556935949, now seen corresponding path program 1 times [2018-11-28 13:25:54,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:54,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:54,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:54,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:54,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:54,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:25:54,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:25:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:25:54,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:25:54,252 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand 4 states. [2018-11-28 13:25:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:54,300 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2018-11-28 13:25:54,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:25:54,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-28 13:25:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:54,301 INFO L225 Difference]: With dead ends: 188 [2018-11-28 13:25:54,301 INFO L226 Difference]: Without dead ends: 188 [2018-11-28 13:25:54,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:25:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-28 13:25:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 167. [2018-11-28 13:25:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-28 13:25:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2018-11-28 13:25:54,304 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 29 [2018-11-28 13:25:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:54,304 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2018-11-28 13:25:54,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:25:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2018-11-28 13:25:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:25:54,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:54,305 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] [2018-11-28 13:25:54,305 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:54,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1570211192, now seen corresponding path program 1 times [2018-11-28 13:25:54,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:54,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:54,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:54,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:54,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:54,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:54,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:25:54,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:25:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:25:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:54,375 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand 8 states. [2018-11-28 13:25:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:54,593 INFO L93 Difference]: Finished difference Result 254 states and 290 transitions. [2018-11-28 13:25:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:25:54,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-28 13:25:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:54,594 INFO L225 Difference]: With dead ends: 254 [2018-11-28 13:25:54,594 INFO L226 Difference]: Without dead ends: 254 [2018-11-28 13:25:54,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:25:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-28 13:25:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 179. [2018-11-28 13:25:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-28 13:25:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2018-11-28 13:25:54,598 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 33 [2018-11-28 13:25:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:54,598 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2018-11-28 13:25:54,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:25:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2018-11-28 13:25:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:25:54,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:54,599 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] [2018-11-28 13:25:54,599 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:54,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:54,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1966241453, now seen corresponding path program 1 times [2018-11-28 13:25:54,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:54,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:54,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:54,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:25:54,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:25:54,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:54,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:25:54,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:25:54,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:25:54,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:25:54,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:25:54,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-28 13:25:54,809 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 21 treesize of output 16 [2018-11-28 13:25:54,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:54,812 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 16 treesize of output 23 [2018-11-28 13:25:54,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,829 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 21 treesize of output 16 [2018-11-28 13:25:54,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:54,831 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 16 treesize of output 23 [2018-11-28 13:25:54,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-28 13:25:54,877 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 24 treesize of output 18 [2018-11-28 13:25:54,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:54,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 13:25:54,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,895 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 24 treesize of output 18 [2018-11-28 13:25:54,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:54,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 13:25:54,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-11-28 13:25:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:54,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:25:54,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-28 13:25:54,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:25:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:25:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:25:54,932 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand 10 states. [2018-11-28 13:25:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:55,204 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-11-28 13:25:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:25:55,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-28 13:25:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:55,206 INFO L225 Difference]: With dead ends: 289 [2018-11-28 13:25:55,206 INFO L226 Difference]: Without dead ends: 289 [2018-11-28 13:25:55,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:25:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-28 13:25:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 207. [2018-11-28 13:25:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-28 13:25:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2018-11-28 13:25:55,212 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 35 [2018-11-28 13:25:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:55,212 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2018-11-28 13:25:55,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:25:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2018-11-28 13:25:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:25:55,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:55,213 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, 1] [2018-11-28 13:25:55,214 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:55,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:55,214 INFO L82 PathProgramCache]: Analyzing trace with hash 405098964, now seen corresponding path program 1 times [2018-11-28 13:25:55,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:55,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:55,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:55,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:55,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:55,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:55,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:25:55,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:25:55,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:25:55,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:25:55,262 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand 5 states. [2018-11-28 13:25:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:55,453 INFO L93 Difference]: Finished difference Result 305 states and 365 transitions. [2018-11-28 13:25:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:25:55,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-28 13:25:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:55,455 INFO L225 Difference]: With dead ends: 305 [2018-11-28 13:25:55,455 INFO L226 Difference]: Without dead ends: 305 [2018-11-28 13:25:55,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-28 13:25:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 206. [2018-11-28 13:25:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-28 13:25:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-11-28 13:25:55,458 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 35 [2018-11-28 13:25:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:55,458 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-11-28 13:25:55,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:25:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-11-28 13:25:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:25:55,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:55,459 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, 1] [2018-11-28 13:25:55,459 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:55,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash 405098965, now seen corresponding path program 1 times [2018-11-28 13:25:55,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:55,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:55,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:55,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:55,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:55,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:25:55,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:25:55,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:25:55,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:25:55,505 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 5 states. [2018-11-28 13:25:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:55,669 INFO L93 Difference]: Finished difference Result 331 states and 398 transitions. [2018-11-28 13:25:55,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:25:55,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-28 13:25:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:55,671 INFO L225 Difference]: With dead ends: 331 [2018-11-28 13:25:55,671 INFO L226 Difference]: Without dead ends: 331 [2018-11-28 13:25:55,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-28 13:25:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-11-28 13:25:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-28 13:25:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 246 transitions. [2018-11-28 13:25:55,675 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 246 transitions. Word has length 35 [2018-11-28 13:25:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:55,675 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 246 transitions. [2018-11-28 13:25:55,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:25:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2018-11-28 13:25:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 13:25:55,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:55,676 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, 1, 1, 1] [2018-11-28 13:25:55,676 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:55,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:55,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1264619924, now seen corresponding path program 1 times [2018-11-28 13:25:55,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:55,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:55,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:55,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:55,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:55,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:25:55,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:25:55,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:25:55,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:25:55,783 INFO L87 Difference]: Start difference. First operand 205 states and 246 transitions. Second operand 11 states. [2018-11-28 13:25:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:56,211 INFO L93 Difference]: Finished difference Result 393 states and 445 transitions. [2018-11-28 13:25:56,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:25:56,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-28 13:25:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:56,213 INFO L225 Difference]: With dead ends: 393 [2018-11-28 13:25:56,213 INFO L226 Difference]: Without dead ends: 393 [2018-11-28 13:25:56,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:25:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-28 13:25:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 208. [2018-11-28 13:25:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-28 13:25:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2018-11-28 13:25:56,218 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 37 [2018-11-28 13:25:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:56,219 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2018-11-28 13:25:56,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:25:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2018-11-28 13:25:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 13:25:56,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:56,219 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, 1, 1, 1] [2018-11-28 13:25:56,220 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:56,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1264619923, now seen corresponding path program 1 times [2018-11-28 13:25:56,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:56,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:56,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:56,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:56,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:25:56,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:25:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:25:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:25:56,386 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 11 states. [2018-11-28 13:25:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:56,986 INFO L93 Difference]: Finished difference Result 437 states and 490 transitions. [2018-11-28 13:25:56,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:25:56,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-28 13:25:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:56,987 INFO L225 Difference]: With dead ends: 437 [2018-11-28 13:25:56,987 INFO L226 Difference]: Without dead ends: 437 [2018-11-28 13:25:56,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-11-28 13:25:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-11-28 13:25:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 214. [2018-11-28 13:25:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-28 13:25:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions. [2018-11-28 13:25:56,991 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 37 [2018-11-28 13:25:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:56,991 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions. [2018-11-28 13:25:56,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:25:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions. [2018-11-28 13:25:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 13:25:56,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:56,991 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, 1, 1, 1, 1] [2018-11-28 13:25:56,991 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:56,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:56,992 INFO L82 PathProgramCache]: Analyzing trace with hash -554748027, now seen corresponding path program 1 times [2018-11-28 13:25:56,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:56,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:56,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:56,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:56,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:57,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:57,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:25:57,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:25:57,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:25:57,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:57,054 INFO L87 Difference]: Start difference. First operand 214 states and 253 transitions. Second operand 8 states. [2018-11-28 13:25:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:57,234 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2018-11-28 13:25:57,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:25:57,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-28 13:25:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:57,235 INFO L225 Difference]: With dead ends: 227 [2018-11-28 13:25:57,235 INFO L226 Difference]: Without dead ends: 227 [2018-11-28 13:25:57,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:25:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-28 13:25:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 213. [2018-11-28 13:25:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-28 13:25:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2018-11-28 13:25:57,238 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 38 [2018-11-28 13:25:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:57,238 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2018-11-28 13:25:57,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:25:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2018-11-28 13:25:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 13:25:57,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:57,239 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, 1, 1, 1, 1] [2018-11-28 13:25:57,239 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:57,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:57,239 INFO L82 PathProgramCache]: Analyzing trace with hash -554748026, now seen corresponding path program 1 times [2018-11-28 13:25:57,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:57,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:57,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:57,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:57,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:57,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:25:57,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:25:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:25:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:25:57,327 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand 8 states. [2018-11-28 13:25:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:57,555 INFO L93 Difference]: Finished difference Result 226 states and 267 transitions. [2018-11-28 13:25:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:25:57,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-28 13:25:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:57,556 INFO L225 Difference]: With dead ends: 226 [2018-11-28 13:25:57,556 INFO L226 Difference]: Without dead ends: 226 [2018-11-28 13:25:57,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:25:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-28 13:25:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2018-11-28 13:25:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-28 13:25:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 251 transitions. [2018-11-28 13:25:57,559 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 251 transitions. Word has length 38 [2018-11-28 13:25:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:57,559 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 251 transitions. [2018-11-28 13:25:57,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:25:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 251 transitions. [2018-11-28 13:25:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 13:25:57,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:57,560 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:57,560 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:57,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1645703445, now seen corresponding path program 1 times [2018-11-28 13:25:57,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:57,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:57,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:57,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:25:57,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:57,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:25:57,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:25:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:25:57,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:25:57,611 INFO L87 Difference]: Start difference. First operand 212 states and 251 transitions. Second operand 7 states. [2018-11-28 13:25:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:57,724 INFO L93 Difference]: Finished difference Result 226 states and 265 transitions. [2018-11-28 13:25:57,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:25:57,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-28 13:25:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:57,725 INFO L225 Difference]: With dead ends: 226 [2018-11-28 13:25:57,725 INFO L226 Difference]: Without dead ends: 226 [2018-11-28 13:25:57,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:25:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-28 13:25:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2018-11-28 13:25:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-28 13:25:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 260 transitions. [2018-11-28 13:25:57,728 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 260 transitions. Word has length 41 [2018-11-28 13:25:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:57,728 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 260 transitions. [2018-11-28 13:25:57,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:25:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 260 transitions. [2018-11-28 13:25:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:25:57,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:57,728 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] [2018-11-28 13:25:57,729 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:57,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1572806925, now seen corresponding path program 1 times [2018-11-28 13:25:57,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:57,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:57,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:57,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:25:57,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:25:57,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:57,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:25:57,880 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 13 treesize of output 10 [2018-11-28 13:25:57,882 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 10 treesize of output 9 [2018-11-28 13:25:57,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:57,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:57,893 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 13 treesize of output 10 [2018-11-28 13:25:57,895 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 10 treesize of output 9 [2018-11-28 13:25:57,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:57,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:57,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:57,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-28 13:25:58,048 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 24 treesize of output 18 [2018-11-28 13:25:58,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:58,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:58,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-11-28 13:25:58,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:25:58,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:25:58,075 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 24 treesize of output 18 [2018-11-28 13:25:58,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:58,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:58,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-11-28 13:25:58,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:25:58,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:25:58,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:25:58,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-11-28 13:25:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:25:58,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:25:58,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-11-28 13:25:58,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:25:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:25:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:25:58,170 INFO L87 Difference]: Start difference. First operand 221 states and 260 transitions. Second operand 17 states. [2018-11-28 13:25:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:59,144 INFO L93 Difference]: Finished difference Result 485 states and 528 transitions. [2018-11-28 13:25:59,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 13:25:59,144 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-28 13:25:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:59,146 INFO L225 Difference]: With dead ends: 485 [2018-11-28 13:25:59,146 INFO L226 Difference]: Without dead ends: 485 [2018-11-28 13:25:59,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 13:25:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-28 13:25:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 243. [2018-11-28 13:25:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-28 13:25:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 289 transitions. [2018-11-28 13:25:59,150 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 289 transitions. Word has length 44 [2018-11-28 13:25:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:59,150 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 289 transitions. [2018-11-28 13:25:59,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:25:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 289 transitions. [2018-11-28 13:25:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:25:59,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:59,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:59,151 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:59,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1512375263, now seen corresponding path program 1 times [2018-11-28 13:25:59,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:59,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:59,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:59,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:59,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:25:59,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:25:59,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:25:59,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:59,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:25:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:25:59,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:25:59,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 5 [2018-11-28 13:25:59,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:25:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:25:59,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2018-11-28 13:25:59,744 INFO L87 Difference]: Start difference. First operand 243 states and 289 transitions. Second operand 6 states. [2018-11-28 13:25:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:59,829 INFO L93 Difference]: Finished difference Result 273 states and 319 transitions. [2018-11-28 13:25:59,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:25:59,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-28 13:25:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:59,830 INFO L225 Difference]: With dead ends: 273 [2018-11-28 13:25:59,830 INFO L226 Difference]: Without dead ends: 250 [2018-11-28 13:25:59,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2018-11-28 13:25:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-28 13:25:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-11-28 13:25:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-28 13:25:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 296 transitions. [2018-11-28 13:25:59,833 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 296 transitions. Word has length 45 [2018-11-28 13:25:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:59,833 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 296 transitions. [2018-11-28 13:25:59,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:25:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 296 transitions. [2018-11-28 13:25:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:25:59,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:59,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:25:59,834 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:25:59,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash 401679881, now seen corresponding path program 1 times [2018-11-28 13:25:59,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:59,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:59,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:59,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:59,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:25:59,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:25:59,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:25:59,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:25:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:25:59,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:25:59,923 INFO L87 Difference]: Start difference. First operand 250 states and 296 transitions. Second operand 10 states. [2018-11-28 13:26:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:26:00,259 INFO L93 Difference]: Finished difference Result 403 states and 466 transitions. [2018-11-28 13:26:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:26:00,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-28 13:26:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:26:00,261 INFO L225 Difference]: With dead ends: 403 [2018-11-28 13:26:00,261 INFO L226 Difference]: Without dead ends: 403 [2018-11-28 13:26:00,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:26:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-11-28 13:26:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 257. [2018-11-28 13:26:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-28 13:26:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2018-11-28 13:26:00,265 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 45 [2018-11-28 13:26:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:26:00,265 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2018-11-28 13:26:00,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:26:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2018-11-28 13:26:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:26:00,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:26:00,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:26:00,266 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:26:00,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash 401679882, now seen corresponding path program 1 times [2018-11-28 13:26:00,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:00,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:00,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:26:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:26:00,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:26:00,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:26:00,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:26:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:26:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:26:00,402 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand 10 states. [2018-11-28 13:26:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:26:00,824 INFO L93 Difference]: Finished difference Result 406 states and 470 transitions. [2018-11-28 13:26:00,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:26:00,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-28 13:26:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:26:00,827 INFO L225 Difference]: With dead ends: 406 [2018-11-28 13:26:00,827 INFO L226 Difference]: Without dead ends: 406 [2018-11-28 13:26:00,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:26:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-28 13:26:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 263. [2018-11-28 13:26:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-28 13:26:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 310 transitions. [2018-11-28 13:26:00,830 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 310 transitions. Word has length 45 [2018-11-28 13:26:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:26:00,831 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 310 transitions. [2018-11-28 13:26:00,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:26:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 310 transitions. [2018-11-28 13:26:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:26:00,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:26:00,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:26:00,832 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION]=== [2018-11-28 13:26:00,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1090480954, now seen corresponding path program 1 times [2018-11-28 13:26:00,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:00,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:00,868 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:26:00,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:26:00 BoogieIcfgContainer [2018-11-28 13:26:00,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:26:00,896 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:26:00,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:26:00,896 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:26:00,896 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:25:50" (3/4) ... [2018-11-28 13:26:00,901 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:26:00,942 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9b6bf93e-6c6a-4aa5-a98b-f7d288b7a907/bin-2019/uautomizer/witness.graphml [2018-11-28 13:26:00,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:26:00,943 INFO L168 Benchmark]: Toolchain (without parser) took 11253.63 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.5 MB). Free memory was 951.7 MB in the beginning and 1.3 GB in the end (delta: -337.2 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:00,944 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:26:00,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:00,945 INFO L168 Benchmark]: Boogie Preprocessor took 53.99 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:00,945 INFO L168 Benchmark]: RCFGBuilder took 565.42 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: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:00,945 INFO L168 Benchmark]: TraceAbstraction took 10249.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -224.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:26:00,945 INFO L168 Benchmark]: Witness Printer took 46.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:26:00,947 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.99 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 565.42 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: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10249.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -224.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 46.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] list->inner->next = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] list->inner->inner = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={11:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR end->inner VAL [end={10:0}, end->inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={10:0}, inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={10:0}, inner={11:0}, inner->next={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={10:0}, inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1029] inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 167 locations, 65 error locations. UNSAFE Result, 10.2s OverallTime, 26 OverallIterations, 2 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3340 SDtfs, 6490 SDslu, 10793 SDs, 0 SdLazy, 9438 SolverSat, 472 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 152 SyntacticMatches, 8 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2215 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 828 ConstructedInterpolants, 10 QuantifiedInterpolants, 283503 SizeOfPredicates, 22 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 9/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...