./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/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-0ed9222-m [2019-01-13 23:48:13,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:48:13,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:48:13,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:48:13,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:48:13,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:48:13,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:48:13,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:48:13,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:48:13,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:48:13,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:48:13,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:48:13,512 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:48:13,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:48:13,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:48:13,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:48:13,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:48:13,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:48:13,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:48:13,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:48:13,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:48:13,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:48:13,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:48:13,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:48:13,533 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:48:13,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:48:13,536 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:48:13,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:48:13,537 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:48:13,538 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:48:13,539 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:48:13,539 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:48:13,540 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:48:13,540 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:48:13,541 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:48:13,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:48:13,542 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 23:48:13,562 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:48:13,562 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:48:13,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:48:13,564 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:48:13,564 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:48:13,564 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:48:13,564 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:48:13,564 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:48:13,564 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:48:13,565 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:48:13,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:48:13,565 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:48:13,565 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:48:13,565 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:48:13,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:48:13,566 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:48:13,567 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:48:13,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:48:13,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:48:13,568 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:48:13,568 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:48:13,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:48:13,568 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:48:13,568 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:48:13,568 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 23:48:13,570 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:48:13,570 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 [2019-01-13 23:48:13,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:48:13,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:48:13,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:48:13,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:48:13,637 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:48:13,637 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2019-01-13 23:48:13,702 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9eb34d8/428285277ca94eb0b291290983c17ad3/FLAGe4018a36f [2019-01-13 23:48:14,269 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:48:14,269 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2019-01-13 23:48:14,283 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9eb34d8/428285277ca94eb0b291290983c17ad3/FLAGe4018a36f [2019-01-13 23:48:14,530 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9eb34d8/428285277ca94eb0b291290983c17ad3 [2019-01-13 23:48:14,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:48:14,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:48:14,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:48:14,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:48:14,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:48:14,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:48:14" (1/1) ... [2019-01-13 23:48:14,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e13714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:14, skipping insertion in model container [2019-01-13 23:48:14,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:48:14" (1/1) ... [2019-01-13 23:48:14,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:48:14,611 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:48:14,947 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:48:14,956 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:48:15,074 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:48:15,131 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:48:15,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15 WrapperNode [2019-01-13 23:48:15,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:48:15,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:48:15,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:48:15,132 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:48:15,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (1/1) ... [2019-01-13 23:48:15,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (1/1) ... [2019-01-13 23:48:15,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (1/1) ... [2019-01-13 23:48:15,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (1/1) ... [2019-01-13 23:48:15,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (1/1) ... [2019-01-13 23:48:15,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (1/1) ... [2019-01-13 23:48:15,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (1/1) ... [2019-01-13 23:48:15,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:48:15,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:48:15,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:48:15,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:48:15,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:48:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:48:15,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:48:15,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:48:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:48:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:48:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:48:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:48:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:48:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:48:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:48:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:48:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:48:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:48:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:48:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:48:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:48:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:48:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:48:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:48:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:48:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:48:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:48:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:48:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:48:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:48:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:48:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:48:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:48:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:48:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:48:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:48:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:48:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:48:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:48:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:48:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:48:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:48:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:48:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:48:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:48:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:48:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:48:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:48:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:48:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:48:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:48:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:48:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:48:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:48:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:48:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:48:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:48:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:48:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-13 23:48:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:48:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:48:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-13 23:48:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:48:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:48:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-13 23:48:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:48:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:48:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:48:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:48:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:48:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:48:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:48:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:48:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:48:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:48:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:48:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:48:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:48:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:48:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:48:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:48:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:48:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:48:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:48:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:48:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:48:15,311 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:48:15,312 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:48:15,312 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:48:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:48:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 23:48:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:48:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:48:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:48:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:48:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:48:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:48:15,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:48:16,659 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:48:16,660 INFO L286 CfgBuilder]: Removed 30 assue(true) statements. [2019-01-13 23:48:16,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:48:16 BoogieIcfgContainer [2019-01-13 23:48:16,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:48:16,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:48:16,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:48:16,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:48:16,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:48:14" (1/3) ... [2019-01-13 23:48:16,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416fbc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:48:16, skipping insertion in model container [2019-01-13 23:48:16,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:15" (2/3) ... [2019-01-13 23:48:16,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416fbc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:48:16, skipping insertion in model container [2019-01-13 23:48:16,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:48:16" (3/3) ... [2019-01-13 23:48:16,673 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2019-01-13 23:48:16,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:48:16,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2019-01-13 23:48:16,711 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2019-01-13 23:48:16,738 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:48:16,740 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:48:16,740 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:48:16,740 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:48:16,741 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:48:16,741 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:48:16,741 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:48:16,741 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:48:16,742 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:48:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2019-01-13 23:48:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-13 23:48:16,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:16,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:16,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash -928996123, now seen corresponding path program 1 times [2019-01-13 23:48:16,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:16,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:16,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:16,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:16,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:16,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:48:16,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:48:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:48:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:48:16,996 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 3 states. [2019-01-13 23:48:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:17,466 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2019-01-13 23:48:17,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:48:17,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-13 23:48:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:17,479 INFO L225 Difference]: With dead ends: 172 [2019-01-13 23:48:17,479 INFO L226 Difference]: Without dead ends: 168 [2019-01-13 23:48:17,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:48:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-13 23:48:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2019-01-13 23:48:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-13 23:48:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2019-01-13 23:48:17,559 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 7 [2019-01-13 23:48:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:17,561 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2019-01-13 23:48:17,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:48:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2019-01-13 23:48:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-13 23:48:17,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:17,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:17,563 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash -928996122, now seen corresponding path program 1 times [2019-01-13 23:48:17,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:17,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:17,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:48:17,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:48:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:48:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:48:17,734 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand 3 states. [2019-01-13 23:48:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:18,250 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-01-13 23:48:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:48:18,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-13 23:48:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:18,255 INFO L225 Difference]: With dead ends: 187 [2019-01-13 23:48:18,256 INFO L226 Difference]: Without dead ends: 187 [2019-01-13 23:48:18,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:48:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-13 23:48:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2019-01-13 23:48:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-13 23:48:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2019-01-13 23:48:18,273 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 7 [2019-01-13 23:48:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:18,273 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2019-01-13 23:48:18,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:48:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2019-01-13 23:48:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 23:48:18,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:18,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:18,276 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash -694003629, now seen corresponding path program 1 times [2019-01-13 23:48:18,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:18,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:18,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:18,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:18,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:18,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:48:18,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:18,391 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand 5 states. [2019-01-13 23:48:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:19,282 INFO L93 Difference]: Finished difference Result 297 states and 327 transitions. [2019-01-13 23:48:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:19,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 23:48:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:19,286 INFO L225 Difference]: With dead ends: 297 [2019-01-13 23:48:19,286 INFO L226 Difference]: Without dead ends: 297 [2019-01-13 23:48:19,287 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 [2019-01-13 23:48:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-01-13 23:48:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 172. [2019-01-13 23:48:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-13 23:48:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2019-01-13 23:48:19,302 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 14 [2019-01-13 23:48:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:19,302 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2019-01-13 23:48:19,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2019-01-13 23:48:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 23:48:19,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:19,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:19,305 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash -694003628, now seen corresponding path program 1 times [2019-01-13 23:48:19,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:19,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:19,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:19,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:19,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:48:19,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:19,454 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 5 states. [2019-01-13 23:48:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:20,023 INFO L93 Difference]: Finished difference Result 321 states and 362 transitions. [2019-01-13 23:48:20,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:20,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 23:48:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:20,027 INFO L225 Difference]: With dead ends: 321 [2019-01-13 23:48:20,027 INFO L226 Difference]: Without dead ends: 321 [2019-01-13 23:48:20,028 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 [2019-01-13 23:48:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-13 23:48:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 171. [2019-01-13 23:48:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-13 23:48:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2019-01-13 23:48:20,040 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 14 [2019-01-13 23:48:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:20,041 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2019-01-13 23:48:20,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2019-01-13 23:48:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:48:20,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:20,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:20,044 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash 910461370, now seen corresponding path program 1 times [2019-01-13 23:48:20,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:20,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:20,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:20,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:48:20,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:48:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:48:20,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:48:20,253 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 8 states. [2019-01-13 23:48:20,448 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 23:48:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:21,548 INFO L93 Difference]: Finished difference Result 299 states and 327 transitions. [2019-01-13 23:48:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:48:21,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-13 23:48:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:21,552 INFO L225 Difference]: With dead ends: 299 [2019-01-13 23:48:21,553 INFO L226 Difference]: Without dead ends: 299 [2019-01-13 23:48:21,554 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 [2019-01-13 23:48:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-13 23:48:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 170. [2019-01-13 23:48:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-13 23:48:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2019-01-13 23:48:21,564 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 17 [2019-01-13 23:48:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:21,564 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2019-01-13 23:48:21,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:48:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2019-01-13 23:48:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:48:21,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:21,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:21,567 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash 910461371, now seen corresponding path program 1 times [2019-01-13 23:48:21,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:21,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:21,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:21,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:21,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:48:21,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:48:21,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:48:21,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:48:21,967 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand 8 states. [2019-01-13 23:48:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:23,775 INFO L93 Difference]: Finished difference Result 300 states and 328 transitions. [2019-01-13 23:48:23,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:48:23,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-13 23:48:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:23,779 INFO L225 Difference]: With dead ends: 300 [2019-01-13 23:48:23,780 INFO L226 Difference]: Without dead ends: 300 [2019-01-13 23:48:23,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-13 23:48:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-13 23:48:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 169. [2019-01-13 23:48:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-13 23:48:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2019-01-13 23:48:23,789 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 17 [2019-01-13 23:48:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:23,789 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2019-01-13 23:48:23,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:48:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2019-01-13 23:48:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:48:23,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:23,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:23,792 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash -831607406, now seen corresponding path program 1 times [2019-01-13 23:48:23,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:23,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:23,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:23,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:23,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:23,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:23,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:23,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:23,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:23,870 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand 5 states. [2019-01-13 23:48:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:24,278 INFO L93 Difference]: Finished difference Result 252 states and 279 transitions. [2019-01-13 23:48:24,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:24,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-13 23:48:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:24,282 INFO L225 Difference]: With dead ends: 252 [2019-01-13 23:48:24,282 INFO L226 Difference]: Without dead ends: 252 [2019-01-13 23:48:24,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:48:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-13 23:48:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 172. [2019-01-13 23:48:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-13 23:48:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2019-01-13 23:48:24,289 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 21 [2019-01-13 23:48:24,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:24,289 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2019-01-13 23:48:24,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2019-01-13 23:48:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 23:48:24,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:24,292 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] [2019-01-13 23:48:24,292 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1311532823, now seen corresponding path program 1 times [2019-01-13 23:48:24,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:24,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:24,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:24,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:24,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:48:24,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:48:24,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:48:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:48:24,361 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 4 states. [2019-01-13 23:48:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:24,553 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2019-01-13 23:48:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:48:24,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-13 23:48:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:24,556 INFO L225 Difference]: With dead ends: 174 [2019-01-13 23:48:24,557 INFO L226 Difference]: Without dead ends: 174 [2019-01-13 23:48:24,557 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 [2019-01-13 23:48:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-13 23:48:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2019-01-13 23:48:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-13 23:48:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2019-01-13 23:48:24,563 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 23 [2019-01-13 23:48:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:24,563 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-01-13 23:48:24,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:48:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2019-01-13 23:48:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 23:48:24,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:24,564 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] [2019-01-13 23:48:24,565 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1311532824, now seen corresponding path program 1 times [2019-01-13 23:48:24,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:24,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:24,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:24,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:48:24,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:48:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:48:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:48:24,699 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 7 states. [2019-01-13 23:48:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:25,053 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2019-01-13 23:48:25,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:25,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-13 23:48:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:25,057 INFO L225 Difference]: With dead ends: 220 [2019-01-13 23:48:25,057 INFO L226 Difference]: Without dead ends: 220 [2019-01-13 23:48:25,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:48:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-13 23:48:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 186. [2019-01-13 23:48:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-13 23:48:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2019-01-13 23:48:25,065 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 23 [2019-01-13 23:48:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:25,065 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2019-01-13 23:48:25,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:48:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2019-01-13 23:48:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 23:48:25,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:25,068 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] [2019-01-13 23:48:25,070 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:25,070 INFO L82 PathProgramCache]: Analyzing trace with hash 556899944, now seen corresponding path program 1 times [2019-01-13 23:48:25,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:25,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:25,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:25,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:25,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:25,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:25,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:48:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:48:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:48:25,185 INFO L87 Difference]: Start difference. First operand 186 states and 218 transitions. Second operand 6 states. [2019-01-13 23:48:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:25,650 INFO L93 Difference]: Finished difference Result 271 states and 320 transitions. [2019-01-13 23:48:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:48:25,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-13 23:48:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:25,654 INFO L225 Difference]: With dead ends: 271 [2019-01-13 23:48:25,654 INFO L226 Difference]: Without dead ends: 271 [2019-01-13 23:48:25,655 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 [2019-01-13 23:48:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-01-13 23:48:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 185. [2019-01-13 23:48:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-13 23:48:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 217 transitions. [2019-01-13 23:48:25,660 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 217 transitions. Word has length 26 [2019-01-13 23:48:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:25,660 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 217 transitions. [2019-01-13 23:48:25,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:48:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 217 transitions. [2019-01-13 23:48:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 23:48:25,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:25,664 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] [2019-01-13 23:48:25,665 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash 556899945, now seen corresponding path program 1 times [2019-01-13 23:48:25,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:25,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:25,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:25,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:25,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:48:25,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:48:25,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:48:25,839 INFO L87 Difference]: Start difference. First operand 185 states and 217 transitions. Second operand 6 states. [2019-01-13 23:48:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:26,295 INFO L93 Difference]: Finished difference Result 288 states and 346 transitions. [2019-01-13 23:48:26,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:48:26,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-13 23:48:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:26,298 INFO L225 Difference]: With dead ends: 288 [2019-01-13 23:48:26,298 INFO L226 Difference]: Without dead ends: 288 [2019-01-13 23:48:26,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:48:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-13 23:48:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 172. [2019-01-13 23:48:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-13 23:48:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 203 transitions. [2019-01-13 23:48:26,306 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 203 transitions. Word has length 26 [2019-01-13 23:48:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:26,307 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 203 transitions. [2019-01-13 23:48:26,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:48:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 203 transitions. [2019-01-13 23:48:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 23:48:26,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:26,308 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] [2019-01-13 23:48:26,308 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:26,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1620647415, now seen corresponding path program 1 times [2019-01-13 23:48:26,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:26,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:26,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:26,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:26,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:26,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:26,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:26,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:26,528 INFO L87 Difference]: Start difference. First operand 172 states and 203 transitions. Second operand 5 states. [2019-01-13 23:48:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:26,710 INFO L93 Difference]: Finished difference Result 196 states and 212 transitions. [2019-01-13 23:48:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:48:26,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-13 23:48:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:26,713 INFO L225 Difference]: With dead ends: 196 [2019-01-13 23:48:26,713 INFO L226 Difference]: Without dead ends: 196 [2019-01-13 23:48:26,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:48:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-13 23:48:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2019-01-13 23:48:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-13 23:48:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2019-01-13 23:48:26,719 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 29 [2019-01-13 23:48:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:26,720 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2019-01-13 23:48:26,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2019-01-13 23:48:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 23:48:26,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:26,723 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] [2019-01-13 23:48:26,724 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -51857924, now seen corresponding path program 1 times [2019-01-13 23:48:26,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:26,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:26,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:26,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:26,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:26,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:26,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 23:48:26,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:48:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:48:26,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:48:26,904 INFO L87 Difference]: Start difference. First operand 172 states and 201 transitions. Second operand 8 states. [2019-01-13 23:48:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:27,393 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2019-01-13 23:48:27,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:48:27,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-01-13 23:48:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:27,396 INFO L225 Difference]: With dead ends: 263 [2019-01-13 23:48:27,397 INFO L226 Difference]: Without dead ends: 263 [2019-01-13 23:48:27,397 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 [2019-01-13 23:48:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-01-13 23:48:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 184. [2019-01-13 23:48:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-13 23:48:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2019-01-13 23:48:27,402 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 33 [2019-01-13 23:48:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:27,403 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2019-01-13 23:48:27,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:48:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2019-01-13 23:48:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 23:48:27,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:27,404 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] [2019-01-13 23:48:27,405 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2064017871, now seen corresponding path program 1 times [2019-01-13 23:48:27,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:27,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:27,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:27,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:27,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:27,684 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-13 23:48:28,007 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-13 23:48:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:28,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:48:28,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:48:28,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:28,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:48:28,222 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 [2019-01-13 23:48:28,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:48:28,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,273 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 [2019-01-13 23:48:28,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:48:28,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-01-13 23:48:28,354 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 [2019-01-13 23:48:28,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:28,393 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 [2019-01-13 23:48:28,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,496 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 [2019-01-13 23:48:28,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:28,500 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 [2019-01-13 23:48:28,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-01-13 23:48:28,661 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 [2019-01-13 23:48:28,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:28,665 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 [2019-01-13 23:48:28,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,689 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 [2019-01-13 23:48:28,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:28,694 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 [2019-01-13 23:48:28,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:28,710 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2019-01-13 23:48:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:28,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:48:28,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-01-13 23:48:28,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:48:28,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:48:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:48:28,757 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand 10 states. [2019-01-13 23:48:29,787 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-13 23:48:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:30,265 INFO L93 Difference]: Finished difference Result 303 states and 334 transitions. [2019-01-13 23:48:30,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 23:48:30,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-13 23:48:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:30,269 INFO L225 Difference]: With dead ends: 303 [2019-01-13 23:48:30,269 INFO L226 Difference]: Without dead ends: 303 [2019-01-13 23:48:30,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-13 23:48:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-13 23:48:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 212. [2019-01-13 23:48:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-13 23:48:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 254 transitions. [2019-01-13 23:48:30,277 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 254 transitions. Word has length 35 [2019-01-13 23:48:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:30,277 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 254 transitions. [2019-01-13 23:48:30,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:48:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2019-01-13 23:48:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 23:48:30,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:30,278 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] [2019-01-13 23:48:30,279 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 669806936, now seen corresponding path program 1 times [2019-01-13 23:48:30,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:30,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:30,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:30,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:30,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:48:30,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:30,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:30,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:30,469 INFO L87 Difference]: Start difference. First operand 212 states and 254 transitions. Second operand 5 states. [2019-01-13 23:48:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:30,788 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2019-01-13 23:48:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:30,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-13 23:48:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:30,792 INFO L225 Difference]: With dead ends: 314 [2019-01-13 23:48:30,792 INFO L226 Difference]: Without dead ends: 314 [2019-01-13 23:48:30,793 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 [2019-01-13 23:48:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-13 23:48:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 211. [2019-01-13 23:48:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-13 23:48:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 253 transitions. [2019-01-13 23:48:30,798 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 253 transitions. Word has length 35 [2019-01-13 23:48:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:30,799 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 253 transitions. [2019-01-13 23:48:30,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 253 transitions. [2019-01-13 23:48:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 23:48:30,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:30,800 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] [2019-01-13 23:48:30,800 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash 669806937, now seen corresponding path program 1 times [2019-01-13 23:48:30,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:30,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:30,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:30,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:48:30,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:30,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:30,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:30,976 INFO L87 Difference]: Start difference. First operand 211 states and 253 transitions. Second operand 5 states. [2019-01-13 23:48:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:31,293 INFO L93 Difference]: Finished difference Result 341 states and 410 transitions. [2019-01-13 23:48:31,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:31,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-13 23:48:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:31,297 INFO L225 Difference]: With dead ends: 341 [2019-01-13 23:48:31,297 INFO L226 Difference]: Without dead ends: 341 [2019-01-13 23:48:31,298 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 [2019-01-13 23:48:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-01-13 23:48:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 210. [2019-01-13 23:48:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-13 23:48:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2019-01-13 23:48:31,304 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 35 [2019-01-13 23:48:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:31,304 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2019-01-13 23:48:31,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2019-01-13 23:48:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 23:48:31,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:31,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:31,306 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -283329296, now seen corresponding path program 1 times [2019-01-13 23:48:31,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:31,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:31,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:31,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:31,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:31,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 23:48:31,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 23:48:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 23:48:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:48:31,851 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand 11 states. [2019-01-13 23:48:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:33,001 INFO L93 Difference]: Finished difference Result 410 states and 463 transitions. [2019-01-13 23:48:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 23:48:33,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-01-13 23:48:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:33,008 INFO L225 Difference]: With dead ends: 410 [2019-01-13 23:48:33,008 INFO L226 Difference]: Without dead ends: 410 [2019-01-13 23:48:33,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-01-13 23:48:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-13 23:48:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 213. [2019-01-13 23:48:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-13 23:48:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2019-01-13 23:48:33,016 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 37 [2019-01-13 23:48:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:33,016 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2019-01-13 23:48:33,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 23:48:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2019-01-13 23:48:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 23:48:33,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:33,017 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] [2019-01-13 23:48:33,017 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash -283329295, now seen corresponding path program 1 times [2019-01-13 23:48:33,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:33,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:33,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:33,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:33,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 23:48:33,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 23:48:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 23:48:33,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:48:33,292 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 11 states. [2019-01-13 23:48:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:34,543 INFO L93 Difference]: Finished difference Result 458 states and 512 transitions. [2019-01-13 23:48:34,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 23:48:34,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-01-13 23:48:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:34,547 INFO L225 Difference]: With dead ends: 458 [2019-01-13 23:48:34,547 INFO L226 Difference]: Without dead ends: 458 [2019-01-13 23:48:34,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-01-13 23:48:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-01-13 23:48:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 219. [2019-01-13 23:48:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-13 23:48:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2019-01-13 23:48:34,554 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 37 [2019-01-13 23:48:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:34,555 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2019-01-13 23:48:34,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 23:48:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2019-01-13 23:48:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 23:48:34,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:34,556 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] [2019-01-13 23:48:34,556 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash -199509631, now seen corresponding path program 1 times [2019-01-13 23:48:34,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:34,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:34,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:34,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:34,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:34,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:48:34,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:48:34,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:48:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:48:34,720 INFO L87 Difference]: Start difference. First operand 219 states and 259 transitions. Second operand 8 states. [2019-01-13 23:48:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:35,022 INFO L93 Difference]: Finished difference Result 232 states and 274 transitions. [2019-01-13 23:48:35,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:48:35,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-01-13 23:48:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:35,025 INFO L225 Difference]: With dead ends: 232 [2019-01-13 23:48:35,025 INFO L226 Difference]: Without dead ends: 232 [2019-01-13 23:48:35,025 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 [2019-01-13 23:48:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-01-13 23:48:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 218. [2019-01-13 23:48:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-01-13 23:48:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2019-01-13 23:48:35,029 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 38 [2019-01-13 23:48:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:35,030 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-01-13 23:48:35,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:48:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2019-01-13 23:48:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 23:48:35,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:35,031 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] [2019-01-13 23:48:35,031 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash -199509630, now seen corresponding path program 1 times [2019-01-13 23:48:35,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:35,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:35,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:35,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:35,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:35,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:35,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:48:35,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:48:35,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:48:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:48:35,200 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand 8 states. [2019-01-13 23:48:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:35,707 INFO L93 Difference]: Finished difference Result 231 states and 273 transitions. [2019-01-13 23:48:35,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:48:35,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-01-13 23:48:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:35,710 INFO L225 Difference]: With dead ends: 231 [2019-01-13 23:48:35,710 INFO L226 Difference]: Without dead ends: 231 [2019-01-13 23:48:35,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-13 23:48:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-13 23:48:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 217. [2019-01-13 23:48:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-13 23:48:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2019-01-13 23:48:35,716 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 38 [2019-01-13 23:48:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:35,716 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2019-01-13 23:48:35,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:48:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2019-01-13 23:48:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 23:48:35,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:35,735 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] [2019-01-13 23:48:35,735 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:35,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1753341337, now seen corresponding path program 1 times [2019-01-13 23:48:35,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:35,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:35,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:35,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:35,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:48:35,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:35,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:48:35,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:48:35,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:48:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:48:35,965 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand 7 states. [2019-01-13 23:48:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:36,219 INFO L93 Difference]: Finished difference Result 233 states and 273 transitions. [2019-01-13 23:48:36,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:48:36,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-13 23:48:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:36,222 INFO L225 Difference]: With dead ends: 233 [2019-01-13 23:48:36,222 INFO L226 Difference]: Without dead ends: 233 [2019-01-13 23:48:36,223 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 [2019-01-13 23:48:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-01-13 23:48:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2019-01-13 23:48:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-13 23:48:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 266 transitions. [2019-01-13 23:48:36,228 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 266 transitions. Word has length 41 [2019-01-13 23:48:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:36,228 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 266 transitions. [2019-01-13 23:48:36,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:48:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 266 transitions. [2019-01-13 23:48:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 23:48:36,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:36,229 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] [2019-01-13 23:48:36,229 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1423920632, now seen corresponding path program 1 times [2019-01-13 23:48:36,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:36,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:36,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:36,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:36,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:48:36,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:36,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:48:36,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:48:36,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:48:36,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:48:36,305 INFO L87 Difference]: Start difference. First operand 226 states and 266 transitions. Second operand 3 states. [2019-01-13 23:48:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:36,581 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2019-01-13 23:48:36,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:48:36,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-01-13 23:48:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:36,586 INFO L225 Difference]: With dead ends: 233 [2019-01-13 23:48:36,586 INFO L226 Difference]: Without dead ends: 233 [2019-01-13 23:48:36,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:48:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-01-13 23:48:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2019-01-13 23:48:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-13 23:48:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 267 transitions. [2019-01-13 23:48:36,591 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 267 transitions. Word has length 42 [2019-01-13 23:48:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:36,591 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 267 transitions. [2019-01-13 23:48:36,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:48:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 267 transitions. [2019-01-13 23:48:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:48:36,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:36,592 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:36,593 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1372867121, now seen corresponding path program 1 times [2019-01-13 23:48:36,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:36,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:36,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:36,807 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-13 23:48:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:36,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:48:36,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:48:36,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:36,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:48:37,197 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 [2019-01-13 23:48:37,199 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 [2019-01-13 23:48:37,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:37,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:37,243 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 [2019-01-13 23:48:37,246 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 [2019-01-13 23:48:37,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:37,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:37,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:37,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-01-13 23:48:37,590 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 [2019-01-13 23:48:37,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:37,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:37,653 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 [2019-01-13 23:48:37,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 23:48:37,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:48:37,686 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 [2019-01-13 23:48:37,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:37,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:37,699 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 [2019-01-13 23:48:37,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 23:48:37,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:48:37,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:48:37,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2019-01-13 23:48:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:37,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:48:37,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2019-01-13 23:48:37,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 23:48:37,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 23:48:37,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-01-13 23:48:37,922 INFO L87 Difference]: Start difference. First operand 227 states and 267 transitions. Second operand 17 states. [2019-01-13 23:48:38,313 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-01-13 23:48:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:40,052 INFO L93 Difference]: Finished difference Result 501 states and 544 transitions. [2019-01-13 23:48:40,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-13 23:48:40,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-01-13 23:48:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:40,055 INFO L225 Difference]: With dead ends: 501 [2019-01-13 23:48:40,056 INFO L226 Difference]: Without dead ends: 501 [2019-01-13 23:48:40,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2019-01-13 23:48:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-01-13 23:48:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 251. [2019-01-13 23:48:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-13 23:48:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 299 transitions. [2019-01-13 23:48:40,063 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 299 transitions. Word has length 45 [2019-01-13 23:48:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:40,064 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 299 transitions. [2019-01-13 23:48:40,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 23:48:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 299 transitions. [2019-01-13 23:48:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:48:40,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:40,065 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] [2019-01-13 23:48:40,065 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash -762728307, now seen corresponding path program 1 times [2019-01-13 23:48:40,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:40,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:40,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:40,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:48:40,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:40,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 23:48:40,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:48:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:48:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:48:40,308 INFO L87 Difference]: Start difference. First operand 251 states and 299 transitions. Second operand 10 states. [2019-01-13 23:48:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:41,103 INFO L93 Difference]: Finished difference Result 435 states and 502 transitions. [2019-01-13 23:48:41,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 23:48:41,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-01-13 23:48:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:41,107 INFO L225 Difference]: With dead ends: 435 [2019-01-13 23:48:41,108 INFO L226 Difference]: Without dead ends: 435 [2019-01-13 23:48:41,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-01-13 23:48:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-13 23:48:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 258. [2019-01-13 23:48:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-13 23:48:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2019-01-13 23:48:41,113 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 45 [2019-01-13 23:48:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:41,114 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2019-01-13 23:48:41,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:48:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2019-01-13 23:48:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:48:41,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:41,115 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] [2019-01-13 23:48:41,115 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash -762728306, now seen corresponding path program 1 times [2019-01-13 23:48:41,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:41,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:41,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:41,607 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-13 23:48:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:48:41,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:41,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 23:48:41,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:48:41,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:48:41,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:48:41,746 INFO L87 Difference]: Start difference. First operand 258 states and 308 transitions. Second operand 10 states. [2019-01-13 23:48:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:43,202 INFO L93 Difference]: Finished difference Result 438 states and 506 transitions. [2019-01-13 23:48:43,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 23:48:43,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-01-13 23:48:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:43,205 INFO L225 Difference]: With dead ends: 438 [2019-01-13 23:48:43,205 INFO L226 Difference]: Without dead ends: 438 [2019-01-13 23:48:43,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-01-13 23:48:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-01-13 23:48:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 264. [2019-01-13 23:48:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-13 23:48:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2019-01-13 23:48:43,215 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 45 [2019-01-13 23:48:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:43,216 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2019-01-13 23:48:43,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:48:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2019-01-13 23:48:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 23:48:43,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:43,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, 1] [2019-01-13 23:48:43,220 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:43,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash -390791237, now seen corresponding path program 1 times [2019-01-13 23:48:43,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:43,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:48:43,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:48:43,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:48:43,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:43,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:48:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:48:44,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:48:44,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 5 [2019-01-13 23:48:44,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:48:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:48:44,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2019-01-13 23:48:44,084 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 6 states. [2019-01-13 23:48:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:44,295 INFO L93 Difference]: Finished difference Result 295 states and 344 transitions. [2019-01-13 23:48:44,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:48:44,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-01-13 23:48:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:44,298 INFO L225 Difference]: With dead ends: 295 [2019-01-13 23:48:44,298 INFO L226 Difference]: Without dead ends: 271 [2019-01-13 23:48:44,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2019-01-13 23:48:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-01-13 23:48:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-01-13 23:48:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-13 23:48:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 320 transitions. [2019-01-13 23:48:44,308 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 320 transitions. Word has length 46 [2019-01-13 23:48:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:44,308 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 320 transitions. [2019-01-13 23:48:44,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:48:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 320 transitions. [2019-01-13 23:48:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 23:48:44,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:44,309 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] [2019-01-13 23:48:44,310 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-01-13 23:48:44,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:44,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1467570882, now seen corresponding path program 1 times [2019-01-13 23:48:44,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:44,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:44,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:48:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:48:44,391 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 23:48:44,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:48:44 BoogieIcfgContainer [2019-01-13 23:48:44,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:48:44,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:48:44,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:48:44,433 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:48:44,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:48:16" (3/4) ... [2019-01-13 23:48:44,439 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 23:48:44,507 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 23:48:44,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:48:44,509 INFO L168 Benchmark]: Toolchain (without parser) took 29974.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.9 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -152.3 MB). Peak memory consumption was 202.7 MB. Max. memory is 11.5 GB. [2019-01-13 23:48:44,510 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:48:44,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-13 23:48:44,512 INFO L168 Benchmark]: Boogie Preprocessor took 97.36 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-13 23:48:44,513 INFO L168 Benchmark]: RCFGBuilder took 1431.85 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: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-01-13 23:48:44,514 INFO L168 Benchmark]: TraceAbstraction took 27769.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -62.2 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. [2019-01-13 23:48:44,515 INFO L168 Benchmark]: Witness Printer took 73.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-01-13 23:48:44,520 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 596.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.36 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1431.85 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: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27769.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -62.2 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. * Witness Printer took 73.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. 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={3:0}, malloc(sizeof(SLL))={3:0}] [L992] list->next = ((void*)0) VAL [list={3:0}, malloc(sizeof(SLL))={3:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={3:0}, malloc(sizeof(SLL))={3:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) VAL [list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] EXPR list->inner VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] list->inner->next = ((void*)0) VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] EXPR list->inner VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] list->inner->inner = ((void*)0) VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] EXPR list->inner VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={3:0}, list->inner={2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={3:0}, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={3:0}, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={3:0}, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={3:0}, len=0, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1017] EXPR end->inner VAL [end={3:0}, end->inner={2:0}, len=0, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={3:0}, inner={2:0}, len=0, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={3:0}, inner={2:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={3:0}, inner={2:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1025] EXPR inner->inner VAL [end={3:0}, inner={2:0}, inner->inner={0:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={3:0}, inner={2:0}, inner->next={0:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner VAL [end={3:0}, inner={2:0}, inner->inner={0:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={3:0}, inner={0:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1029] inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 67 error locations. UNSAFE Result, 27.7s OverallTime, 27 OverallIterations, 2 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3565 SDtfs, 6903 SDslu, 11154 SDs, 0 SdLazy, 9873 SolverSat, 468 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=26, 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, 26 MinimizatonAttempts, 2387 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 948 NumberOfCodeBlocks, 948 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 873 ConstructedInterpolants, 10 QuantifiedInterpolants, 293820 SizeOfPredicates, 22 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 10/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...