./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/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 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.24-91b1670 [2018-11-28 22:56:41,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:56:41,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:56:41,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:56:41,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:56:41,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:56:41,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:56:41,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:56:41,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:56:41,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:56:41,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:56:41,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:56:41,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:56:41,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:56:41,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:56:41,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:56:41,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:56:41,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:56:41,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:56:41,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:56:41,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:56:41,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:56:41,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:56:41,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:56:41,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:56:41,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:56:41,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:56:41,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:56:41,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:56:41,195 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:56:41,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:56:41,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:56:41,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:56:41,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:56:41,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:56:41,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:56:41,199 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:56:41,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:56:41,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:56:41,226 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:56:41,227 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:56:41,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:56:41,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:56:41,228 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:56:41,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:56:41,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:56:41,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:56:41,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:56:41,229 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:56:41,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:56:41,230 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:56:41,230 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:56:41,230 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:56:41,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:56:41,230 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:56:41,232 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:56:41,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:56:41,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:56:41,233 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:56:41,233 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:56:41,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:56:41,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:56:41,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:56:41,234 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:56:41,234 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:56:41,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-11-28 22:56:41,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:56:41,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:56:41,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:56:41,294 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:56:41,295 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:56:41,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 22:56:41,361 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4ec33de/816473e910a04acfa0a12d889936d8fb/FLAG24b46f4e7 [2018-11-28 22:56:41,911 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:56:41,912 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 22:56:41,926 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4ec33de/816473e910a04acfa0a12d889936d8fb/FLAG24b46f4e7 [2018-11-28 22:56:42,167 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4ec33de/816473e910a04acfa0a12d889936d8fb [2018-11-28 22:56:42,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:56:42,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:56:42,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:56:42,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:56:42,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:56:42,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b980419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42, skipping insertion in model container [2018-11-28 22:56:42,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:56:42,272 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:56:42,674 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:56:42,691 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:56:42,745 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:56:42,893 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:56:42,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42 WrapperNode [2018-11-28 22:56:42,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:56:42,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:56:42,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:56:42,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:56:42,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (1/1) ... [2018-11-28 22:56:42,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:56:42,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:56:42,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:56:42,981 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:56:42,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:56:43,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:56:43,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:56:43,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:56:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:56:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:56:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:56:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:56:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:56:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:56:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:56:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:56:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:56:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:56:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:56:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:56:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:56:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:56:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:56:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:56:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:56:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:56:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:56:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:56:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:56:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:56:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:56:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:56:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:56:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:56:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:56:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:56:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:56:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:56:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:56:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:56:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:56:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:56:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:56:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:56:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:56:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:56:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:56:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:56:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:56:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:56:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:56:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:56:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:56:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:56:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:56:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:56:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:56:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:56:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:56:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:56:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:56:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:56:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:56:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:56:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:56:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:56:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 22:56:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:56:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:56:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 22:56:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:56:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:56:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 22:56:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:56:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:56:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:56:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:56:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:56:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:56:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:56:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:56:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:56:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:56:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:56:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:56:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:56:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:56:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:56:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:56:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:56:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:56:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:56:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:56:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:56:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:56:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:56:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:56:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:56:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:56:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:56:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:56:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:56:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:56:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:56:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:56:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:56:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:56:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:56:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:56:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:56:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:56:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:56:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 22:56:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:56:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:56:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 22:56:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 22:56:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:56:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:56:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:56:44,460 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:56:44,460 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-11-28 22:56:44,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:56:44 BoogieIcfgContainer [2018-11-28 22:56:44,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:56:44,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:56:44,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:56:44,466 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:56:44,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:56:42" (1/3) ... [2018-11-28 22:56:44,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ebcec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:56:44, skipping insertion in model container [2018-11-28 22:56:44,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:56:42" (2/3) ... [2018-11-28 22:56:44,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ebcec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:56:44, skipping insertion in model container [2018-11-28 22:56:44,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:56:44" (3/3) ... [2018-11-28 22:56:44,472 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 22:56:44,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:56:44,492 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-28 22:56:44,510 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-28 22:56:44,540 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:56:44,540 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:56:44,541 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:56:44,541 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:56:44,542 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:56:44,542 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:56:44,542 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:56:44,542 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:56:44,542 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:56:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2018-11-28 22:56:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 22:56:44,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:44,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:56:44,590 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:44,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:44,597 INFO L82 PathProgramCache]: Analyzing trace with hash -184166559, now seen corresponding path program 1 times [2018-11-28 22:56:44,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:44,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:44,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:44,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:44,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:44,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:56:44,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:56:44,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:56:44,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:56:44,782 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 3 states. [2018-11-28 22:56:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:45,362 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-11-28 22:56:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:56:45,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 22:56:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:45,387 INFO L225 Difference]: With dead ends: 168 [2018-11-28 22:56:45,389 INFO L226 Difference]: Without dead ends: 164 [2018-11-28 22:56:45,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:56:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-28 22:56:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2018-11-28 22:56:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-28 22:56:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-11-28 22:56:45,452 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 7 [2018-11-28 22:56:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:45,452 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-11-28 22:56:45,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:56:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-11-28 22:56:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 22:56:45,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:45,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:56:45,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:45,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash -184166558, now seen corresponding path program 1 times [2018-11-28 22:56:45,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:45,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:45,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:45,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:56:45,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:56:45,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:56:45,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:56:45,596 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 3 states. [2018-11-28 22:56:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:46,188 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2018-11-28 22:56:46,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:56:46,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 22:56:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:46,191 INFO L225 Difference]: With dead ends: 179 [2018-11-28 22:56:46,191 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 22:56:46,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:56:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 22:56:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 168. [2018-11-28 22:56:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-28 22:56:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-11-28 22:56:46,208 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 7 [2018-11-28 22:56:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:46,208 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-11-28 22:56:46,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:56:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-11-28 22:56:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:56:46,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:46,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:56:46,209 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:46,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:46,210 INFO L82 PathProgramCache]: Analyzing trace with hash 712155735, now seen corresponding path program 1 times [2018-11-28 22:56:46,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:46,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:46,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:46,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:46,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:56:46,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:56:46,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:56:46,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:56:46,334 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2018-11-28 22:56:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:47,176 INFO L93 Difference]: Finished difference Result 288 states and 317 transitions. [2018-11-28 22:56:47,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:56:47,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 22:56:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:47,181 INFO L225 Difference]: With dead ends: 288 [2018-11-28 22:56:47,181 INFO L226 Difference]: Without dead ends: 288 [2018-11-28 22:56:47,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:56:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-28 22:56:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 167. [2018-11-28 22:56:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-28 22:56:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-28 22:56:47,196 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 14 [2018-11-28 22:56:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:47,197 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-28 22:56:47,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:56:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-28 22:56:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:56:47,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:47,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:56:47,198 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:47,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash 712155736, now seen corresponding path program 1 times [2018-11-28 22:56:47,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:47,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:47,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:47,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:47,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:47,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:56:47,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:56:47,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:56:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:56:47,312 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 5 states. [2018-11-28 22:56:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:48,193 INFO L93 Difference]: Finished difference Result 311 states and 350 transitions. [2018-11-28 22:56:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:56:48,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 22:56:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:48,198 INFO L225 Difference]: With dead ends: 311 [2018-11-28 22:56:48,198 INFO L226 Difference]: Without dead ends: 311 [2018-11-28 22:56:48,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:56:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-28 22:56:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 166. [2018-11-28 22:56:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-28 22:56:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2018-11-28 22:56:48,213 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 14 [2018-11-28 22:56:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:48,214 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2018-11-28 22:56:48,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:56:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2018-11-28 22:56:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:56:48,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:48,216 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 22:56:48,216 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:48,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:48,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1306930890, now seen corresponding path program 1 times [2018-11-28 22:56:48,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:48,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:48,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:48,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:56:48,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:56:48,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:56:48,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:56:48,421 INFO L87 Difference]: Start difference. First operand 166 states and 186 transitions. Second operand 8 states. [2018-11-28 22:56:48,676 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-28 22:56:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:49,724 INFO L93 Difference]: Finished difference Result 290 states and 317 transitions. [2018-11-28 22:56:49,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:56:49,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-28 22:56:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:49,726 INFO L225 Difference]: With dead ends: 290 [2018-11-28 22:56:49,726 INFO L226 Difference]: Without dead ends: 290 [2018-11-28 22:56:49,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:56:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-28 22:56:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 165. [2018-11-28 22:56:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-28 22:56:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-11-28 22:56:49,740 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 17 [2018-11-28 22:56:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:49,740 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-11-28 22:56:49,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:56:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-11-28 22:56:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:56:49,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:49,742 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 22:56:49,743 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:49,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1306930889, now seen corresponding path program 1 times [2018-11-28 22:56:49,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:49,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:49,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:49,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:49,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:56:49,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:56:49,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:56:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:56:49,997 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 8 states. [2018-11-28 22:56:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:51,858 INFO L93 Difference]: Finished difference Result 291 states and 318 transitions. [2018-11-28 22:56:51,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:56:51,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-28 22:56:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:51,862 INFO L225 Difference]: With dead ends: 291 [2018-11-28 22:56:51,862 INFO L226 Difference]: Without dead ends: 291 [2018-11-28 22:56:51,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:56:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-28 22:56:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 164. [2018-11-28 22:56:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-28 22:56:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2018-11-28 22:56:51,873 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 17 [2018-11-28 22:56:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:51,873 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2018-11-28 22:56:51,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:56:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2018-11-28 22:56:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:56:51,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:51,876 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 22:56:51,876 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:51,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1193006862, now seen corresponding path program 1 times [2018-11-28 22:56:51,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:51,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:51,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:51,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:51,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:51,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:51,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:56:51,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:56:51,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:56:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:56:51,998 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand 5 states. [2018-11-28 22:56:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:52,424 INFO L93 Difference]: Finished difference Result 243 states and 269 transitions. [2018-11-28 22:56:52,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:56:52,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-28 22:56:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:52,427 INFO L225 Difference]: With dead ends: 243 [2018-11-28 22:56:52,427 INFO L226 Difference]: Without dead ends: 243 [2018-11-28 22:56:52,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:56:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-28 22:56:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 167. [2018-11-28 22:56:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-28 22:56:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-28 22:56:52,435 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 21 [2018-11-28 22:56:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:52,435 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-28 22:56:52,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:56:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-28 22:56:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:56:52,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:52,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:56:52,439 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:52,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1345659283, now seen corresponding path program 1 times [2018-11-28 22:56:52,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:52,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:52,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:52,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:52,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:56:52,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:56:52,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:56:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:56:52,543 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 4 states. [2018-11-28 22:56:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:52,739 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2018-11-28 22:56:52,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:56:52,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-28 22:56:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:52,741 INFO L225 Difference]: With dead ends: 169 [2018-11-28 22:56:52,742 INFO L226 Difference]: Without dead ends: 169 [2018-11-28 22:56:52,742 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 22:56:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-28 22:56:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2018-11-28 22:56:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-28 22:56:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2018-11-28 22:56:52,747 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 23 [2018-11-28 22:56:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:52,748 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2018-11-28 22:56:52,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:56:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2018-11-28 22:56:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:56:52,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:52,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:56:52,751 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:52,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1345659284, now seen corresponding path program 1 times [2018-11-28 22:56:52,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:52,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:52,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:52,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:52,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:56:52,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:56:52,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:56:52,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:56:52,889 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 6 states. [2018-11-28 22:56:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:53,241 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-28 22:56:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:56:53,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 22:56:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:53,244 INFO L225 Difference]: With dead ends: 207 [2018-11-28 22:56:53,245 INFO L226 Difference]: Without dead ends: 207 [2018-11-28 22:56:53,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:56:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-28 22:56:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2018-11-28 22:56:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-28 22:56:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2018-11-28 22:56:53,252 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 23 [2018-11-28 22:56:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:53,252 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2018-11-28 22:56:53,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:56:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2018-11-28 22:56:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:56:53,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:53,255 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 22:56:53,255 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:53,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash -688979348, now seen corresponding path program 1 times [2018-11-28 22:56:53,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:53,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:53,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:53,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:53,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:53,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:53,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:56:53,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:56:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:56:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:56:53,430 INFO L87 Difference]: Start difference. First operand 181 states and 212 transitions. Second operand 6 states. [2018-11-28 22:56:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:53,858 INFO L93 Difference]: Finished difference Result 262 states and 310 transitions. [2018-11-28 22:56:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:56:53,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 22:56:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:53,861 INFO L225 Difference]: With dead ends: 262 [2018-11-28 22:56:53,861 INFO L226 Difference]: Without dead ends: 262 [2018-11-28 22:56:53,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:56:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-28 22:56:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 180. [2018-11-28 22:56:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-28 22:56:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 211 transitions. [2018-11-28 22:56:53,870 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 211 transitions. Word has length 26 [2018-11-28 22:56:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:53,870 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 211 transitions. [2018-11-28 22:56:53,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:56:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 211 transitions. [2018-11-28 22:56:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:56:53,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:53,873 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 22:56:53,873 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:53,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash -688979347, now seen corresponding path program 1 times [2018-11-28 22:56:53,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:53,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:53,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:54,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:54,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:56:54,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:56:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:56:54,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:56:54,140 INFO L87 Difference]: Start difference. First operand 180 states and 211 transitions. Second operand 6 states. [2018-11-28 22:56:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:54,699 INFO L93 Difference]: Finished difference Result 278 states and 334 transitions. [2018-11-28 22:56:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:56:54,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 22:56:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:54,703 INFO L225 Difference]: With dead ends: 278 [2018-11-28 22:56:54,703 INFO L226 Difference]: Without dead ends: 278 [2018-11-28 22:56:54,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:56:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-28 22:56:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 167. [2018-11-28 22:56:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-28 22:56:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2018-11-28 22:56:54,710 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 26 [2018-11-28 22:56:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:54,710 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2018-11-28 22:56:54,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:56:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2018-11-28 22:56:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:56:54,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:54,713 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 22:56:54,715 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:54,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:54,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1556935949, now seen corresponding path program 1 times [2018-11-28 22:56:54,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:54,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:54,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:54,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:54,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:56:54,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:56:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:56:54,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:56:54,790 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand 4 states. [2018-11-28 22:56:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:54,922 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2018-11-28 22:56:54,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:56:54,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-28 22:56:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:54,925 INFO L225 Difference]: With dead ends: 188 [2018-11-28 22:56:54,925 INFO L226 Difference]: Without dead ends: 188 [2018-11-28 22:56:54,926 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 22:56:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-28 22:56:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 167. [2018-11-28 22:56:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-28 22:56:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2018-11-28 22:56:54,932 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 29 [2018-11-28 22:56:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:54,933 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2018-11-28 22:56:54,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:56:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2018-11-28 22:56:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 22:56:54,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:54,938 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 22:56:54,938 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:54,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:54,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1570211192, now seen corresponding path program 1 times [2018-11-28 22:56:54,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:54,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:54,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:54,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:54,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:55,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:55,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:56:55,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:56:55,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:56:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:56:55,193 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand 8 states. [2018-11-28 22:56:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:56,043 INFO L93 Difference]: Finished difference Result 254 states and 290 transitions. [2018-11-28 22:56:56,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:56:56,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-28 22:56:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:56,046 INFO L225 Difference]: With dead ends: 254 [2018-11-28 22:56:56,046 INFO L226 Difference]: Without dead ends: 254 [2018-11-28 22:56:56,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:56:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-28 22:56:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 179. [2018-11-28 22:56:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-28 22:56:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2018-11-28 22:56:56,057 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 33 [2018-11-28 22:56:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:56,057 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2018-11-28 22:56:56,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:56:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2018-11-28 22:56:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 22:56:56,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:56,063 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 22:56:56,063 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:56,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:56,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1966241453, now seen corresponding path program 1 times [2018-11-28 22:56:56,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:56,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:56,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:56,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:56,364 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-11-28 22:56:56,584 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 22:56:56,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:56:56,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:56:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:56,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:56:56,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:56:56,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:56:56,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:56:56,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:56:56,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:56:56,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:56:56,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:56:56,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:56:56,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:56:56,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-28 22:56:56,863 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 22:56:56,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:56:56,873 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 22:56:56,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:56:56,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:56:56,901 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 22:56:56,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:56:56,944 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 22:56:56,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:56:57,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:56:57,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:56:57,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-28 22:56:57,348 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 22:56:57,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:56:57,366 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 22:56:57,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:56:57,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:56:57,383 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 22:56:57,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:56:57,389 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 22:56:57,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:56:57,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:56:57,403 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 22:56:57,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-11-28 22:56:57,429 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 22:56:57,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:56:57,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-28 22:56:57,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:56:57,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:56:57,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:56:57,450 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand 10 states. [2018-11-28 22:56:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:58,646 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-11-28 22:56:58,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 22:56:58,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-28 22:56:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:58,650 INFO L225 Difference]: With dead ends: 289 [2018-11-28 22:56:58,650 INFO L226 Difference]: Without dead ends: 289 [2018-11-28 22:56:58,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-11-28 22:56:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-28 22:56:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 207. [2018-11-28 22:56:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-28 22:56:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2018-11-28 22:56:58,659 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 35 [2018-11-28 22:56:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:58,659 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2018-11-28 22:56:58,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:56:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2018-11-28 22:56:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 22:56:58,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:58,660 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 22:56:58,663 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:58,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash 405098964, now seen corresponding path program 1 times [2018-11-28 22:56:58,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:58,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:58,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:58,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:58,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:56:58,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:56:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:56:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:56:58,904 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand 5 states. [2018-11-28 22:56:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:56:59,260 INFO L93 Difference]: Finished difference Result 305 states and 365 transitions. [2018-11-28 22:56:59,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:56:59,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-28 22:56:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:56:59,264 INFO L225 Difference]: With dead ends: 305 [2018-11-28 22:56:59,264 INFO L226 Difference]: Without dead ends: 305 [2018-11-28 22:56:59,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:56:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-28 22:56:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 206. [2018-11-28 22:56:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-28 22:56:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-11-28 22:56:59,270 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 35 [2018-11-28 22:56:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:56:59,271 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-11-28 22:56:59,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:56:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-11-28 22:56:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 22:56:59,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:56:59,275 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 22:56:59,275 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:56:59,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:56:59,275 INFO L82 PathProgramCache]: Analyzing trace with hash 405098965, now seen corresponding path program 1 times [2018-11-28 22:56:59,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:56:59,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:56:59,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:59,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:56:59,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:56:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:56:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:56:59,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:56:59,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:56:59,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:56:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:56:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:56:59,529 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 5 states. [2018-11-28 22:57:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:00,099 INFO L93 Difference]: Finished difference Result 331 states and 398 transitions. [2018-11-28 22:57:00,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:57:00,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-28 22:57:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:00,105 INFO L225 Difference]: With dead ends: 331 [2018-11-28 22:57:00,105 INFO L226 Difference]: Without dead ends: 331 [2018-11-28 22:57:00,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:57:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-28 22:57:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-11-28 22:57:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-28 22:57:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 246 transitions. [2018-11-28 22:57:00,114 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 246 transitions. Word has length 35 [2018-11-28 22:57:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:00,115 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 246 transitions. [2018-11-28 22:57:00,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:57:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2018-11-28 22:57:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 22:57:00,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:00,118 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 22:57:00,118 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:00,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1264619924, now seen corresponding path program 1 times [2018-11-28 22:57:00,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:00,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:00,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:57:00,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:57:00,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:57:00,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:57:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:57:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:57:00,545 INFO L87 Difference]: Start difference. First operand 205 states and 246 transitions. Second operand 11 states. [2018-11-28 22:57:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:01,528 INFO L93 Difference]: Finished difference Result 393 states and 445 transitions. [2018-11-28 22:57:01,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 22:57:01,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-28 22:57:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:01,534 INFO L225 Difference]: With dead ends: 393 [2018-11-28 22:57:01,535 INFO L226 Difference]: Without dead ends: 393 [2018-11-28 22:57:01,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:57:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-28 22:57:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 208. [2018-11-28 22:57:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-28 22:57:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2018-11-28 22:57:01,542 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 37 [2018-11-28 22:57:01,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:01,543 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2018-11-28 22:57:01,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:57:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2018-11-28 22:57:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 22:57:01,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:01,544 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 22:57:01,544 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:01,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1264619923, now seen corresponding path program 1 times [2018-11-28 22:57:01,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:01,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:01,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:02,141 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-28 22:57:02,682 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-11-28 22:57:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:57:02,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:57:02,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:57:02,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:57:02,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:57:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:57:02,779 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 11 states. [2018-11-28 22:57:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:04,354 INFO L93 Difference]: Finished difference Result 437 states and 490 transitions. [2018-11-28 22:57:04,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 22:57:04,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-28 22:57:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:04,358 INFO L225 Difference]: With dead ends: 437 [2018-11-28 22:57:04,358 INFO L226 Difference]: Without dead ends: 437 [2018-11-28 22:57:04,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-11-28 22:57:04,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-11-28 22:57:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 214. [2018-11-28 22:57:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-28 22:57:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions. [2018-11-28 22:57:04,366 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 37 [2018-11-28 22:57:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:04,366 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions. [2018-11-28 22:57:04,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:57:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions. [2018-11-28 22:57:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 22:57:04,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:04,367 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 22:57:04,367 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:04,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash -554748027, now seen corresponding path program 1 times [2018-11-28 22:57:04,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:04,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:57:04,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:57:04,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:57:04,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:57:04,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:57:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:57:04,525 INFO L87 Difference]: Start difference. First operand 214 states and 253 transitions. Second operand 8 states. [2018-11-28 22:57:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:04,947 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2018-11-28 22:57:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:57:04,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-28 22:57:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:04,950 INFO L225 Difference]: With dead ends: 227 [2018-11-28 22:57:04,950 INFO L226 Difference]: Without dead ends: 227 [2018-11-28 22:57:04,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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 22:57:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-28 22:57:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 213. [2018-11-28 22:57:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-28 22:57:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2018-11-28 22:57:04,956 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 38 [2018-11-28 22:57:04,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:04,956 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2018-11-28 22:57:04,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:57:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2018-11-28 22:57:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 22:57:04,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:04,957 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 22:57:04,957 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:04,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash -554748026, now seen corresponding path program 1 times [2018-11-28 22:57:04,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:04,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:04,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:04,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:04,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:57:05,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:57:05,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:57:05,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:57:05,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:57:05,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:57:05,136 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand 8 states. [2018-11-28 22:57:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:05,655 INFO L93 Difference]: Finished difference Result 226 states and 267 transitions. [2018-11-28 22:57:05,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:57:05,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-28 22:57:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:05,658 INFO L225 Difference]: With dead ends: 226 [2018-11-28 22:57:05,658 INFO L226 Difference]: Without dead ends: 226 [2018-11-28 22:57:05,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:57:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-28 22:57:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2018-11-28 22:57:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-28 22:57:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 251 transitions. [2018-11-28 22:57:05,665 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 251 transitions. Word has length 38 [2018-11-28 22:57:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:05,666 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 251 transitions. [2018-11-28 22:57:05,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:57:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 251 transitions. [2018-11-28 22:57:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 22:57:05,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:05,667 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 22:57:05,667 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:05,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1645703445, now seen corresponding path program 1 times [2018-11-28 22:57:05,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:05,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:05,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:05,893 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 22:57:05,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:57:05,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:57:05,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:57:05,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:57:05,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:57:05,895 INFO L87 Difference]: Start difference. First operand 212 states and 251 transitions. Second operand 7 states. [2018-11-28 22:57:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:06,141 INFO L93 Difference]: Finished difference Result 226 states and 265 transitions. [2018-11-28 22:57:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:57:06,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-28 22:57:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:06,145 INFO L225 Difference]: With dead ends: 226 [2018-11-28 22:57:06,145 INFO L226 Difference]: Without dead ends: 226 [2018-11-28 22:57:06,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:57:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-28 22:57:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2018-11-28 22:57:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-28 22:57:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 260 transitions. [2018-11-28 22:57:06,150 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 260 transitions. Word has length 41 [2018-11-28 22:57:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:06,150 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 260 transitions. [2018-11-28 22:57:06,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:57:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 260 transitions. [2018-11-28 22:57:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 22:57:06,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:06,151 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 22:57:06,151 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:06,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1572806925, now seen corresponding path program 1 times [2018-11-28 22:57:06,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:06,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:06,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:06,367 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-11-28 22:57:06,463 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 22:57:06,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:57:06,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:57:06,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:06,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:57:06,759 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 22:57:06,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 10 treesize of output 9 [2018-11-28 22:57:06,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:57:06,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:57:06,922 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 22:57:06,935 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 22:57:06,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:57:06,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:57:06,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:57:06,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-28 22:57:07,307 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 22:57:07,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:57:07,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:57:07,366 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 22:57:07,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:57:07,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:57:07,407 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 22:57:07,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:57:07,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:57:07,439 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 22:57:07,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 22:57:07,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:57:07,499 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 22:57:07,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-11-28 22:57:07,574 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 22:57:07,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:57:07,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-11-28 22:57:07,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:57:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:57:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:57:07,597 INFO L87 Difference]: Start difference. First operand 221 states and 260 transitions. Second operand 17 states. [2018-11-28 22:57:07,964 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-11-28 22:57:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:09,910 INFO L93 Difference]: Finished difference Result 485 states and 528 transitions. [2018-11-28 22:57:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 22:57:09,916 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-28 22:57:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:09,918 INFO L225 Difference]: With dead ends: 485 [2018-11-28 22:57:09,918 INFO L226 Difference]: Without dead ends: 485 [2018-11-28 22:57:09,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 22:57:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-28 22:57:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 243. [2018-11-28 22:57:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-28 22:57:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 289 transitions. [2018-11-28 22:57:09,926 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 289 transitions. Word has length 44 [2018-11-28 22:57:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:09,926 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 289 transitions. [2018-11-28 22:57:09,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:57:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 289 transitions. [2018-11-28 22:57:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 22:57:09,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:09,927 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 22:57:09,928 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:09,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1512375263, now seen corresponding path program 1 times [2018-11-28 22:57:09,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:09,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:09,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:10,161 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 22:57:10,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:57:10,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:57:10,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:10,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:57:10,927 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 22:57:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:57:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 5 [2018-11-28 22:57:10,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:57:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:57:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2018-11-28 22:57:10,959 INFO L87 Difference]: Start difference. First operand 243 states and 289 transitions. Second operand 6 states. [2018-11-28 22:57:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:11,207 INFO L93 Difference]: Finished difference Result 273 states and 319 transitions. [2018-11-28 22:57:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:57:11,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-28 22:57:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:11,210 INFO L225 Difference]: With dead ends: 273 [2018-11-28 22:57:11,210 INFO L226 Difference]: Without dead ends: 250 [2018-11-28 22:57:11,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2018-11-28 22:57:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-28 22:57:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-11-28 22:57:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-28 22:57:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 296 transitions. [2018-11-28 22:57:11,218 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 296 transitions. Word has length 45 [2018-11-28 22:57:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:11,218 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 296 transitions. [2018-11-28 22:57:11,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:57:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 296 transitions. [2018-11-28 22:57:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 22:57:11,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:11,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:57:11,223 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:11,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash 401679881, now seen corresponding path program 1 times [2018-11-28 22:57:11,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:11,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:11,410 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 22:57:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:57:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:57:11,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:57:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:57:11,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:57:11,411 INFO L87 Difference]: Start difference. First operand 250 states and 296 transitions. Second operand 10 states. [2018-11-28 22:57:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:12,155 INFO L93 Difference]: Finished difference Result 403 states and 466 transitions. [2018-11-28 22:57:12,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:57:12,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-28 22:57:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:12,160 INFO L225 Difference]: With dead ends: 403 [2018-11-28 22:57:12,160 INFO L226 Difference]: Without dead ends: 403 [2018-11-28 22:57:12,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-11-28 22:57:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-11-28 22:57:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 257. [2018-11-28 22:57:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-28 22:57:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2018-11-28 22:57:12,167 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 45 [2018-11-28 22:57:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:12,167 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2018-11-28 22:57:12,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:57:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2018-11-28 22:57:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 22:57:12,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:12,169 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 22:57:12,169 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:12,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:12,169 INFO L82 PathProgramCache]: Analyzing trace with hash 401679882, now seen corresponding path program 1 times [2018-11-28 22:57:12,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:12,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:12,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:57:12,523 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 22:57:12,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:57:12,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:57:12,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:57:12,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:57:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:57:12,524 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand 10 states. [2018-11-28 22:57:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:57:13,999 INFO L93 Difference]: Finished difference Result 406 states and 470 transitions. [2018-11-28 22:57:14,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:57:14,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-28 22:57:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:57:14,003 INFO L225 Difference]: With dead ends: 406 [2018-11-28 22:57:14,003 INFO L226 Difference]: Without dead ends: 406 [2018-11-28 22:57:14,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:57:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-28 22:57:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 263. [2018-11-28 22:57:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-28 22:57:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 310 transitions. [2018-11-28 22:57:14,009 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 310 transitions. Word has length 45 [2018-11-28 22:57:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:57:14,009 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 310 transitions. [2018-11-28 22:57:14,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:57:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 310 transitions. [2018-11-28 22:57:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 22:57:14,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:57:14,010 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 22:57:14,010 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2018-11-28 22:57:14,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:57:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1090480954, now seen corresponding path program 1 times [2018-11-28 22:57:14,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:57:14,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:57:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:14,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:57:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:57:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 22:57:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 22:57:14,087 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 22:57:14,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:57:14 BoogieIcfgContainer [2018-11-28 22:57:14,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:57:14,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:57:14,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:57:14,145 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:57:14,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:56:44" (3/4) ... [2018-11-28 22:57:14,148 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 22:57:14,233 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:57:14,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:57:14,235 INFO L168 Benchmark]: Toolchain (without parser) took 32057.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.0 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -281.1 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:57:14,236 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:57:14,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:57:14,237 INFO L168 Benchmark]: Boogie Preprocessor took 85.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:57:14,238 INFO L168 Benchmark]: RCFGBuilder took 1479.74 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.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:57:14,238 INFO L168 Benchmark]: TraceAbstraction took 29682.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -172.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:57:14,239 INFO L168 Benchmark]: Witness Printer took 88.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:57:14,242 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 715.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1479.74 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.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29682.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -172.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Witness Printer took 88.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->next = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->inner = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10: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))={11:0}, malloc(sizeof(SLL))={10: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))={11:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR end->inner VAL [end={10:0}, end->inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10: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))={11:0}, malloc(sizeof(SLL))={10:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10: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))={11:0}, malloc(sizeof(SLL))={10: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))={11:0}, malloc(sizeof(SLL))={10: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))={11:0}, malloc(sizeof(SLL))={10:0}] [L1029] inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 167 locations, 65 error locations. UNSAFE Result, 29.6s OverallTime, 26 OverallIterations, 2 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3340 SDtfs, 6490 SDslu, 10793 SDs, 0 SdLazy, 9438 SolverSat, 472 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 152 SyntacticMatches, 8 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 10.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.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 2215 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.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...